Pub Date : 2021-01-01DOI: 10.1504/ijie.2021.10043220
B. Kumari, S. Patnaik, T. Swarnkar
{"title":"Feature selection for stock price prediction: a critical review","authors":"B. Kumari, S. Patnaik, T. Swarnkar","doi":"10.1504/ijie.2021.10043220","DOIUrl":"https://doi.org/10.1504/ijie.2021.10043220","url":null,"abstract":"","PeriodicalId":39490,"journal":{"name":"International Journal of Intelligent Enterprise","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67050386","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-01DOI: 10.1504/ijie.2020.10031676
A. Rao, P. Bhuvaneshwari
{"title":"Product recommendation system using optimal switching hybrid algorithm","authors":"A. Rao, P. Bhuvaneshwari","doi":"10.1504/ijie.2020.10031676","DOIUrl":"https://doi.org/10.1504/ijie.2020.10031676","url":null,"abstract":"","PeriodicalId":39490,"journal":{"name":"International Journal of Intelligent Enterprise","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67047734","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-01DOI: 10.1504/IJIE.2021.10035239
H. Omari
{"title":"Saudis perception of medical information privacy: a point-of-view on the use of medical technology","authors":"H. Omari","doi":"10.1504/IJIE.2021.10035239","DOIUrl":"https://doi.org/10.1504/IJIE.2021.10035239","url":null,"abstract":"","PeriodicalId":39490,"journal":{"name":"International Journal of Intelligent Enterprise","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67048921","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-01DOI: 10.1504/ijie.2021.10034443
S. Kalaivani, B. Ray
On the visual perception, the real-world objects are the collection of irregular polygons. Representation and understanding the irregular polygon is an interesting and major task in various research areas. However, an approximation of the polygon is quite complex and challenging in different views. In this paper, a new approximation algorithm is proposed to represent the irregular polygon. Using centroid most of the weak points are suppressed and elimination of noise is integrated to produce better results. Iterative insertion of the dominant point is followed with suppression until the required approximation. The proposed method detects the dominant points which have a high impact on the shape and suppress the weak points. The obtained approximated polygon is with fewer vertices/points and retain the original shape with less approximation error. The experiments of the proposed algorithm are conducted using MPEG shape datasets to show its performance both in quantitative and qualitative aspect.
{"title":"A new dominant point detection technique for polygonal approximation of digital planar closed curves","authors":"S. Kalaivani, B. Ray","doi":"10.1504/ijie.2021.10034443","DOIUrl":"https://doi.org/10.1504/ijie.2021.10034443","url":null,"abstract":"On the visual perception, the real-world objects are the collection of irregular polygons. Representation and understanding the irregular polygon is an interesting and major task in various research areas. However, an approximation of the polygon is quite complex and challenging in different views. In this paper, a new approximation algorithm is proposed to represent the irregular polygon. Using centroid most of the weak points are suppressed and elimination of noise is integrated to produce better results. Iterative insertion of the dominant point is followed with suppression until the required approximation. The proposed method detects the dominant points which have a high impact on the shape and suppress the weak points. The obtained approximated polygon is with fewer vertices/points and retain the original shape with less approximation error. The experiments of the proposed algorithm are conducted using MPEG shape datasets to show its performance both in quantitative and qualitative aspect.","PeriodicalId":39490,"journal":{"name":"International Journal of Intelligent Enterprise","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67048178","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-01DOI: 10.1504/ijie.2021.10034452
Bhabani Mallia, Chakradhar Das, M. Das, S. Patnaik
A special type of multi-objective transportation problem with emphasis on consumer to consumer relationship is presented. The objective is to minimise total transportation cost along with source to consumer and consumer to consumer association/relationship in vicinity of the source. A lexicographical goal programming model has been applied. Two phase approach has been made. In the first phase the total transportation cost is minimised. In the second phase, overall independence value of the consumer to consumer association/relation is minimised. This model can give a better result than a single objective transportation model. That is because the source to consumer association/relationship is considered in the first priority to get the lowest cost and the vicinity of consumers in the periphery of the source. In the second priority grouping is made for consumers to be served in the same warehouse, provided the capacity of the source is sufficient to meet the consumer's demand.
{"title":"A new approach to multi-objective transportation problem forbinding relationship between warehouse to consumer and consumer to consumer","authors":"Bhabani Mallia, Chakradhar Das, M. Das, S. Patnaik","doi":"10.1504/ijie.2021.10034452","DOIUrl":"https://doi.org/10.1504/ijie.2021.10034452","url":null,"abstract":"A special type of multi-objective transportation problem with emphasis on consumer to consumer relationship is presented. The objective is to minimise total transportation cost along with source to consumer and consumer to consumer association/relationship in vicinity of the source. A lexicographical goal programming model has been applied. Two phase approach has been made. In the first phase the total transportation cost is minimised. In the second phase, overall independence value of the consumer to consumer association/relation is minimised. This model can give a better result than a single objective transportation model. That is because the source to consumer association/relationship is considered in the first priority to get the lowest cost and the vicinity of consumers in the periphery of the source. In the second priority grouping is made for consumers to be served in the same warehouse, provided the capacity of the source is sufficient to meet the consumer's demand.","PeriodicalId":39490,"journal":{"name":"International Journal of Intelligent Enterprise","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67048833","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-01DOI: 10.1504/IJIE.2021.10038607
P. Nagaraj, A. Vamsi, P. Deepalakshmi, Akash Awasthi
{"title":"Movable barcode scanning system using IoT smart glass technology","authors":"P. Nagaraj, A. Vamsi, P. Deepalakshmi, Akash Awasthi","doi":"10.1504/IJIE.2021.10038607","DOIUrl":"https://doi.org/10.1504/IJIE.2021.10038607","url":null,"abstract":"","PeriodicalId":39490,"journal":{"name":"International Journal of Intelligent Enterprise","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67049622","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-01DOI: 10.1504/ijie.2021.10040007
N. Prabakaran, R. Vinothkanna, T. Vijayakumar
{"title":"High performance inventive system for gait automation and detection of physically disabled persons","authors":"N. Prabakaran, R. Vinothkanna, T. Vijayakumar","doi":"10.1504/ijie.2021.10040007","DOIUrl":"https://doi.org/10.1504/ijie.2021.10040007","url":null,"abstract":"","PeriodicalId":39490,"journal":{"name":"International Journal of Intelligent Enterprise","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67049792","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：