Pub Date : 2017-09-01DOI: 10.1109/ICRITO.2017.8342464
Kumari Nidhi Lal, Anoj Kumar
Beginning with the recent availability of wireless medical sensor prototype and growing, the need for E-health care application record databases, we analyze the requirement of a unified communication framework in overcoming generation network. This paper proposes Information-centric networking based framework over WBAN as the primary enabler for E-health applications. If users of wireless body area network (WBAN) use IP network, they face many issues such as packet loss, security etc. So, Information-centric network (ICN) is proposed to solve such problems with exploitation many advantages like efficient resource management, scalability, reduction of traffic and security. ICN router has the caching capability to cache the contents. In this way, users of ICN-based WBAN do not need to directly connect with the hospital server to access patient data. Further, we propose a protocol for ICN-WBAN to provide a secure, efficient and reliable E-health application services to meet the required needs of the current IP protocol stack and devices.
{"title":"E-health application using network coding based caching for Information-centric networking (ICN)","authors":"Kumari Nidhi Lal, Anoj Kumar","doi":"10.1109/ICRITO.2017.8342464","DOIUrl":"https://doi.org/10.1109/ICRITO.2017.8342464","url":null,"abstract":"Beginning with the recent availability of wireless medical sensor prototype and growing, the need for E-health care application record databases, we analyze the requirement of a unified communication framework in overcoming generation network. This paper proposes Information-centric networking based framework over WBAN as the primary enabler for E-health applications. If users of wireless body area network (WBAN) use IP network, they face many issues such as packet loss, security etc. So, Information-centric network (ICN) is proposed to solve such problems with exploitation many advantages like efficient resource management, scalability, reduction of traffic and security. ICN router has the caching capability to cache the contents. In this way, users of ICN-based WBAN do not need to directly connect with the hospital server to access patient data. Further, we propose a protocol for ICN-WBAN to provide a secure, efficient and reliable E-health application services to meet the required needs of the current IP protocol stack and devices.","PeriodicalId":357118,"journal":{"name":"2017 6th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125188345","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 : 2017-09-01DOI: 10.1109/ICRITO.2017.8342470
Vikramaditya Agarwal, A. Sahai, Akshay Gupta, Nidhi Jain
Fingerprint, Signature, Iris biometric identification are some of the best authentication system used nowadays. Biometric system finds its application in fields like passport, banking, mobiles or laptops (i.e. gadgets), houses, offices, Aadhaar Card, forensic depts. etc. The aim of this paper is to discuss the Steps involved in identifying and verifying users using biometric systems along with their advantages and disadvantages. This paper also discusses about various performance parameters, applications and future scope of these biometric systems.
{"title":"Human identification and verification based on signature, fingerprint and iris integration","authors":"Vikramaditya Agarwal, A. Sahai, Akshay Gupta, Nidhi Jain","doi":"10.1109/ICRITO.2017.8342470","DOIUrl":"https://doi.org/10.1109/ICRITO.2017.8342470","url":null,"abstract":"Fingerprint, Signature, Iris biometric identification are some of the best authentication system used nowadays. Biometric system finds its application in fields like passport, banking, mobiles or laptops (i.e. gadgets), houses, offices, Aadhaar Card, forensic depts. etc. The aim of this paper is to discuss the Steps involved in identifying and verifying users using biometric systems along with their advantages and disadvantages. This paper also discusses about various performance parameters, applications and future scope of these biometric systems.","PeriodicalId":357118,"journal":{"name":"2017 6th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO)","volume":"399 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115202270","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 : 2017-09-01DOI: 10.1109/ICRITO.2017.8342463
Tanisha Gahlawat, P. Bhatia, D. Mehrotra
The paper investigates various factors (System Reliability, User Efficacy, User behavior and User cognitive skills) that affect a user while retrieving information. These factors can be used to improve the efficiency of the system. In this research, we have created a model improving the classical IR model. The factors that affect the user are clubbed together to form a User Characteristic Data (UCD). The system interacts with the UCD to obtain the results as per the user query. The model takes in user's relevance feedback to update the UCD. The objective here is to retrieve better results every time the user wants some information. Therefore, the IIR models should consider these factors while evaluating the documents for the query given by the user for his information need.
{"title":"The relationship between user preferences in interactive information retrieval evaluation","authors":"Tanisha Gahlawat, P. Bhatia, D. Mehrotra","doi":"10.1109/ICRITO.2017.8342463","DOIUrl":"https://doi.org/10.1109/ICRITO.2017.8342463","url":null,"abstract":"The paper investigates various factors (System Reliability, User Efficacy, User behavior and User cognitive skills) that affect a user while retrieving information. These factors can be used to improve the efficiency of the system. In this research, we have created a model improving the classical IR model. The factors that affect the user are clubbed together to form a User Characteristic Data (UCD). The system interacts with the UCD to obtain the results as per the user query. The model takes in user's relevance feedback to update the UCD. The objective here is to retrieve better results every time the user wants some information. Therefore, the IIR models should consider these factors while evaluating the documents for the query given by the user for his information need.","PeriodicalId":357118,"journal":{"name":"2017 6th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129591272","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 : 2017-09-01DOI: 10.1109/ICRITO.2017.8342506
N. Joshi, Sarika Jain, Amit Agarwal
Magnetic resonance images contain various types of noise which become an obstacle in the correct diagnosis of any disease. Therefore noise reduction becomes a major task while working with MRI. Denoising of MR images removes the undesirable noise but simultaneously preserves the image features too. Various noise removal techniques have been proposed for handling MR Images. The task of denoising becomes less complex if segmentation is performed along with. This paper suggests a novel method for reducing the effect of noise by amalgamating segmentation technique with a group of denoising filters. The denoising filters include the use of median filter, wiener filter and the Non local means filter.
{"title":"Segmentation based non local means filter for denoising MRI","authors":"N. Joshi, Sarika Jain, Amit Agarwal","doi":"10.1109/ICRITO.2017.8342506","DOIUrl":"https://doi.org/10.1109/ICRITO.2017.8342506","url":null,"abstract":"Magnetic resonance images contain various types of noise which become an obstacle in the correct diagnosis of any disease. Therefore noise reduction becomes a major task while working with MRI. Denoising of MR images removes the undesirable noise but simultaneously preserves the image features too. Various noise removal techniques have been proposed for handling MR Images. The task of denoising becomes less complex if segmentation is performed along with. This paper suggests a novel method for reducing the effect of noise by amalgamating segmentation technique with a group of denoising filters. The denoising filters include the use of median filter, wiener filter and the Non local means filter.","PeriodicalId":357118,"journal":{"name":"2017 6th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124203731","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 : 2017-09-01DOI: 10.1109/ICRITO.2017.8342477
Shipra Singh, R. Verma
Herein the analysis anddesign of symmetrical Notch S Shape patch Antenna which has wideband applications. Nowadays Wireless Communication requires such antennas which can be serve for multiple bands instead of a particular band as in conventional antenna system. This is achieved by creating notch in patch. For design of proposed antenna FR-4 having a thickness of 1.6 mm is used as a substrate material. HFSS software is used to design and simulate the proposed antenna. The return loss below −10db is achieved at frequency range from 3.5 GHz to 12 GHz.
{"title":"Design and analysis of symmetrical notch S shape patch antenna for wideband applications","authors":"Shipra Singh, R. Verma","doi":"10.1109/ICRITO.2017.8342477","DOIUrl":"https://doi.org/10.1109/ICRITO.2017.8342477","url":null,"abstract":"Herein the analysis anddesign of symmetrical Notch S Shape patch Antenna which has wideband applications. Nowadays Wireless Communication requires such antennas which can be serve for multiple bands instead of a particular band as in conventional antenna system. This is achieved by creating notch in patch. For design of proposed antenna FR-4 having a thickness of 1.6 mm is used as a substrate material. HFSS software is used to design and simulate the proposed antenna. The return loss below −10db is achieved at frequency range from 3.5 GHz to 12 GHz.","PeriodicalId":357118,"journal":{"name":"2017 6th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114824083","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 : 2017-09-01DOI: 10.1109/CTCEEC.2017.8454973
Kamalpreet Bindra, Dr Anuranjan Misra
The foremost illustrative task in data mining process is clustering. It plays an exceedingly important role in the entire KDD process also as categorizing data is one of the most rudimentary steps in knowledge discovery. It is an unsupervised learning task used for exploratory data analysis to find some unrevealed patterns which are present in data but cannot be categorized clearly. Sets of data can be designated or grouped together based on some common characteristics and termed clusters, the mechanism involved in cluster analysis are essentially dependent upon the primary task of keeping objects with in a cluster more closer than objects belonging to other groups or clusters. Depending on the data and expected cluster characteristics there are different types of clustering paradigms. In the very recent times many new algorithms have emerged which aim towards bridging the different approaches towards clustering and merging different clustering algorithms given the requirement of handling sequential, extensive data with multiple relationships in many applications across a broad spectrum. Various clustering algorithms have been developed under different paradigms for grouping scattered data points and forming efficient cluster shapes with minimal outliers. This paper attempts to address the problem of creating evenly shaped clusters in detail and aims to study, review and analyze few clustering algorithms falling under different categories of clustering paradigms and presents a detailed comparison of their efficiency, advantages and disadvantages on some common grounds. This study also contributes in correlating some very important characteristics of an efficient clustering algorithm.
{"title":"A detailed study of clustering algorithms","authors":"Kamalpreet Bindra, Dr Anuranjan Misra","doi":"10.1109/CTCEEC.2017.8454973","DOIUrl":"https://doi.org/10.1109/CTCEEC.2017.8454973","url":null,"abstract":"The foremost illustrative task in data mining process is clustering. It plays an exceedingly important role in the entire KDD process also as categorizing data is one of the most rudimentary steps in knowledge discovery. It is an unsupervised learning task used for exploratory data analysis to find some unrevealed patterns which are present in data but cannot be categorized clearly. Sets of data can be designated or grouped together based on some common characteristics and termed clusters, the mechanism involved in cluster analysis are essentially dependent upon the primary task of keeping objects with in a cluster more closer than objects belonging to other groups or clusters. Depending on the data and expected cluster characteristics there are different types of clustering paradigms. In the very recent times many new algorithms have emerged which aim towards bridging the different approaches towards clustering and merging different clustering algorithms given the requirement of handling sequential, extensive data with multiple relationships in many applications across a broad spectrum. Various clustering algorithms have been developed under different paradigms for grouping scattered data points and forming efficient cluster shapes with minimal outliers. This paper attempts to address the problem of creating evenly shaped clusters in detail and aims to study, review and analyze few clustering algorithms falling under different categories of clustering paradigms and presents a detailed comparison of their efficiency, advantages and disadvantages on some common grounds. This study also contributes in correlating some very important characteristics of an efficient clustering algorithm.","PeriodicalId":357118,"journal":{"name":"2017 6th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133533546","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 : 2017-09-01DOI: 10.1109/ICRITO.2017.8342485
Abdul Raoof Wani, Q. P. Rana, Nitin Pandey
Cloud computing environment gives people to share resources, services and information. This environment is adopted by large number of organizations, so the rapid transition towards the cloud has fuelled concerns on security perspective. Encryption algorithms play main role in solving such kind of problems in the cloud computing environment. This paper proposes the structure for cloud security with efficient security in communication system and AES based file encryption system. This security architecture can be easily applied on PaaS, IaaS and SaaS and one time password provides extra security in the authenticating users. This paper presents the security of whole cloud computing environment.
{"title":"Cloud security architecture based on user authentication and symmetric key cryptographic techniques","authors":"Abdul Raoof Wani, Q. P. Rana, Nitin Pandey","doi":"10.1109/ICRITO.2017.8342485","DOIUrl":"https://doi.org/10.1109/ICRITO.2017.8342485","url":null,"abstract":"Cloud computing environment gives people to share resources, services and information. This environment is adopted by large number of organizations, so the rapid transition towards the cloud has fuelled concerns on security perspective. Encryption algorithms play main role in solving such kind of problems in the cloud computing environment. This paper proposes the structure for cloud security with efficient security in communication system and AES based file encryption system. This security architecture can be easily applied on PaaS, IaaS and SaaS and one time password provides extra security in the authenticating users. This paper presents the security of whole cloud computing environment.","PeriodicalId":357118,"journal":{"name":"2017 6th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO)","volume":"8 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115676381","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 : 2017-09-01DOI: 10.1109/ICRITO.2017.8342458
Dr. Aleem Ali, Neeta Singh
This paper analyses analytical model M/M/1/K/K for Mobile Adhoc Network (MANET) with a finite number of packets and a finite number of nodes. The service disciple for the packets is taken to be First Come First Serve (FCFS). The expression for the various performance measures such as the mean number of packets in the node, Average Waiting Time (AWT), Node Utilization (NU), Queue length distribution, Packet Drop Probability (PDP) and throughput are obtained. Numerical results are presented to facilitate the significance of the model.
{"title":"An analytical model for performance analysis of mobile ad hoc network using queueing approach","authors":"Dr. Aleem Ali, Neeta Singh","doi":"10.1109/ICRITO.2017.8342458","DOIUrl":"https://doi.org/10.1109/ICRITO.2017.8342458","url":null,"abstract":"This paper analyses analytical model M/M/1/K/K for Mobile Adhoc Network (MANET) with a finite number of packets and a finite number of nodes. The service disciple for the packets is taken to be First Come First Serve (FCFS). The expression for the various performance measures such as the mean number of packets in the node, Average Waiting Time (AWT), Node Utilization (NU), Queue length distribution, Packet Drop Probability (PDP) and throughput are obtained. Numerical results are presented to facilitate the significance of the model.","PeriodicalId":357118,"journal":{"name":"2017 6th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129835520","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 : 2017-09-01DOI: 10.1109/ICRITO.2017.8342444
G. Jain, Meenal Jain, Gaurav Gupta
Approximate computing has a very important contribution in the multimedia world. Approximate computing consists of arithmetic circuits such as adder, multiplier etc. Which are based on the approximate technique or error tolerant application. These arithmetic circuits have high efficiency and better performance, but less accurate. In an electronic world, many applications are used such as signal processing, network signaling, image processing, neural networks where multiplier is used as an arithmetic circuit. In this way, approximate multiplier shows some mean error which is not so important at large. This multiplier makes significant improvements in power, delay, and area at the expense of reducing accuracy. The approximate multiplier is to use less power and area than conventional truncated multiplier, and keep high speed. Its main purpose is to speed up the speed of arithmetic circuits as well as spend low power. A lot of process is being taken to fulfill this objective Like ETM (Error tolerant Multiplier), UDM (Under designed Multiplier), AWTM (Approx Wallace Tree Multiplier), AM (Approx Multiplier). In this paper, the approximate Booth Multiplier has been designed which works on error tolerant multiplication (ETM) technology and provides high performance for the DSP application. This Error Tolerant Application easily restrict on accuracy and achieve various improvement in power consumption and speed accuracy. A new type of approximate multiplier has been designed in this multiplier which can increase the speed by reducing the partial product of the traditional multiplier. According to this paper is to design such a high-speed radix signed approximate booth multiplier which provides significant improvements in power, delay and area at low cost performance in accuracy.
{"title":"Design of radix-4,16,32 approx booth multiplier using Error Tolerant Application","authors":"G. Jain, Meenal Jain, Gaurav Gupta","doi":"10.1109/ICRITO.2017.8342444","DOIUrl":"https://doi.org/10.1109/ICRITO.2017.8342444","url":null,"abstract":"Approximate computing has a very important contribution in the multimedia world. Approximate computing consists of arithmetic circuits such as adder, multiplier etc. Which are based on the approximate technique or error tolerant application. These arithmetic circuits have high efficiency and better performance, but less accurate. In an electronic world, many applications are used such as signal processing, network signaling, image processing, neural networks where multiplier is used as an arithmetic circuit. In this way, approximate multiplier shows some mean error which is not so important at large. This multiplier makes significant improvements in power, delay, and area at the expense of reducing accuracy. The approximate multiplier is to use less power and area than conventional truncated multiplier, and keep high speed. Its main purpose is to speed up the speed of arithmetic circuits as well as spend low power. A lot of process is being taken to fulfill this objective Like ETM (Error tolerant Multiplier), UDM (Under designed Multiplier), AWTM (Approx Wallace Tree Multiplier), AM (Approx Multiplier). In this paper, the approximate Booth Multiplier has been designed which works on error tolerant multiplication (ETM) technology and provides high performance for the DSP application. This Error Tolerant Application easily restrict on accuracy and achieve various improvement in power consumption and speed accuracy. A new type of approximate multiplier has been designed in this multiplier which can increase the speed by reducing the partial product of the traditional multiplier. According to this paper is to design such a high-speed radix signed approximate booth multiplier which provides significant improvements in power, delay and area at low cost performance in accuracy.","PeriodicalId":357118,"journal":{"name":"2017 6th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129157527","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 : 2017-09-01DOI: 10.1109/ICRITO.2017.8342449
Deeksha, Shashank Sahu
Clustering is a vital method within which bunching of articles occurred in the groups in such how that articles of a similar group contain a lot of similarity than the articles into other groups. This paper discussed numerous clustering techniques for finding similarity in articles. These clustering techniques are Hierarchical, K-means, and K-medoids clustering. In this paper, the research focus is to compare several distance measures and find out appropriate distance measure that is used to check the similarity in articles. Distance measure performs a crucial role in the performance of these algorithms. We use different distance measure methods of Hierarchical, K-means, and K-medoids clustering. Here, an experimental examines are performed in Matlab and results show that in Hierarchical clustering Euclidean distance measure, in K-means clustering Correlation distance measure, and in K-medoids clustering City block distance measure provides better results.
{"title":"Finding similarity in articles using various clustering techniques","authors":"Deeksha, Shashank Sahu","doi":"10.1109/ICRITO.2017.8342449","DOIUrl":"https://doi.org/10.1109/ICRITO.2017.8342449","url":null,"abstract":"Clustering is a vital method within which bunching of articles occurred in the groups in such how that articles of a similar group contain a lot of similarity than the articles into other groups. This paper discussed numerous clustering techniques for finding similarity in articles. These clustering techniques are Hierarchical, K-means, and K-medoids clustering. In this paper, the research focus is to compare several distance measures and find out appropriate distance measure that is used to check the similarity in articles. Distance measure performs a crucial role in the performance of these algorithms. We use different distance measure methods of Hierarchical, K-means, and K-medoids clustering. Here, an experimental examines are performed in Matlab and results show that in Hierarchical clustering Euclidean distance measure, in K-means clustering Correlation distance measure, and in K-medoids clustering City block distance measure provides better results.","PeriodicalId":357118,"journal":{"name":"2017 6th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121508797","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
扫码关注我们
求助内容：
应助结果提醒方式：