Document clustering refers to unsupervised classification (categorization) of documents into groups (clusters) in such a way that the documents in a cluster are similar, whereas documents in different clusters are dissimilar. The documents may be web pages, blog posts, news articles, or other text files. This paper presents our experimental work on applying K-means, heuristic K-means and fuzzy C-means algorithms for clustering text documents. We have experimented with different representations (tf, tf.idf & Boolean) and different feature selection schemes (with or without stop word removal & with or without stemming). We ran our implementations on some standard datasets and computed various performance measures for these algorithms. The results indicate that tf.idf representation, and use of stemming obtains better clustering. Moreover, fuzzy clustering produces better results than both K-means and heuristic K-means on almost all datasets, and is a more stable method.
{"title":"Document Clustering Using K-Means, Heuristic K-Means and Fuzzy C-Means","authors":"V. Singh, Nisha Tiwari, Shekhar Garg","doi":"10.1109/CICN.2011.62","DOIUrl":"https://doi.org/10.1109/CICN.2011.62","url":null,"abstract":"Document clustering refers to unsupervised classification (categorization) of documents into groups (clusters) in such a way that the documents in a cluster are similar, whereas documents in different clusters are dissimilar. The documents may be web pages, blog posts, news articles, or other text files. This paper presents our experimental work on applying K-means, heuristic K-means and fuzzy C-means algorithms for clustering text documents. We have experimented with different representations (tf, tf.idf & Boolean) and different feature selection schemes (with or without stop word removal & with or without stemming). We ran our implementations on some standard datasets and computed various performance measures for these algorithms. The results indicate that tf.idf representation, and use of stemming obtains better clustering. Moreover, fuzzy clustering produces better results than both K-means and heuristic K-means on almost all datasets, and is a more stable method.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133636957","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}
An architecture to simplify the circuit implementation of analog-to-digital (A/D) converter in a sigma-delta (S?) modulator is proposed. The two-step quantization technique is utilized to design architecture of S? modulator. The architecture is based on dividing the A/D conversion into two time steps for achieving resolution improvement without decreasing speed. The novel architecture is designed to obtain high dynamic range of input signal, high signal-to-noise ratio and high reliability. Switched capacitor (SC) modulator performance is prone to various nonidealities, which affects overall circuit performance. In this paper a set of models are proposed which takes into account SC S? modulator nonidealities, such as sampling jitter, kT/C noise, and operational amplifier parameters (noise, finite dc gain, finite bandwidth, slew-rate and saturation voltages). Each nonidealities are modelled mathematically and their behaviour is verified using different analysis in MATLAB Simulink. Simulation results on a second-order SC S? modulator with two step quantization demonstrate the validity of the models proposed.
{"title":"Modeling of Sigma-Delta Modulator Non-idealities with Two Step Quantization in MATLAB/SIMULINK","authors":"S. Jaykar, P. Palsodkar, P. Dakhole","doi":"10.1109/CICN.2011.114","DOIUrl":"https://doi.org/10.1109/CICN.2011.114","url":null,"abstract":"An architecture to simplify the circuit implementation of analog-to-digital (A/D) converter in a sigma-delta (S?) modulator is proposed. The two-step quantization technique is utilized to design architecture of S? modulator. The architecture is based on dividing the A/D conversion into two time steps for achieving resolution improvement without decreasing speed. The novel architecture is designed to obtain high dynamic range of input signal, high signal-to-noise ratio and high reliability. Switched capacitor (SC) modulator performance is prone to various nonidealities, which affects overall circuit performance. In this paper a set of models are proposed which takes into account SC S? modulator nonidealities, such as sampling jitter, kT/C noise, and operational amplifier parameters (noise, finite dc gain, finite bandwidth, slew-rate and saturation voltages). Each nonidealities are modelled mathematically and their behaviour is verified using different analysis in MATLAB Simulink. Simulation results on a second-order SC S? modulator with two step quantization demonstrate the validity of the models proposed.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120936107","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}
The next generation internet protocol version 6 was developed by the network working group of the Internet Engineering Task Force (IETF), to extend and eventually replace IPv4 capabilities and brings many new features over IPv4 like large address space, flow labelling capabilities, expended address capabilities, demand for real time data transfer, security at IP level and so on. However there are various vulnerabilities reported in contrast to the new features emerging in IPv6. One of the kinds of these vulnerabilities exists in routing header of IPv6. Routing header is a kind of extension header of IPv6 and it's used by an IPv6 source to list one or more intermediate nodes to be visited on the way to a packet destination. But routing header has serious vulnerability and by using this vulnerability attacker can by-pass the security principles at packet filtering system such as router/firewall without breaking the packet filtering rules and than he can access the internal protected network by using routing header. This paper suggests a prevention algorithm that uses with existed packet filtering system and solves the vulnerabilities caused by routing header.
{"title":"Prevention Algorithm against the Vulnerability of Type 0 Routing Header in Ipv6","authors":"Mohit Wadhwa, Manju Khari","doi":"10.1109/CICN.2011.133","DOIUrl":"https://doi.org/10.1109/CICN.2011.133","url":null,"abstract":"The next generation internet protocol version 6 was developed by the network working group of the Internet Engineering Task Force (IETF), to extend and eventually replace IPv4 capabilities and brings many new features over IPv4 like large address space, flow labelling capabilities, expended address capabilities, demand for real time data transfer, security at IP level and so on. However there are various vulnerabilities reported in contrast to the new features emerging in IPv6. One of the kinds of these vulnerabilities exists in routing header of IPv6. Routing header is a kind of extension header of IPv6 and it's used by an IPv6 source to list one or more intermediate nodes to be visited on the way to a packet destination. But routing header has serious vulnerability and by using this vulnerability attacker can by-pass the security principles at packet filtering system such as router/firewall without breaking the packet filtering rules and than he can access the internal protected network by using routing header. This paper suggests a prevention algorithm that uses with existed packet filtering system and solves the vulnerabilities caused by routing header.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115533383","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}
The ETS (Edge Table Scanning) algorithm for graph coloring problem colors almost any graph with minimum number of colors, but still, it has a limitation. This paper explains that limitation and also introduces an approach to resolve the limitation. We here-after call that approach as the "sequencing" algorithm.
{"title":"Add-On to the ETS Algorithm to Improve Its Efficiency in Special Cases Such as a Crown Graph","authors":"P. Jain, S. Mathur, P. Bhatt","doi":"10.1109/CICN.2011.22","DOIUrl":"https://doi.org/10.1109/CICN.2011.22","url":null,"abstract":"The ETS (Edge Table Scanning) algorithm for graph coloring problem colors almost any graph with minimum number of colors, but still, it has a limitation. This paper explains that limitation and also introduces an approach to resolve the limitation. We here-after call that approach as the \"sequencing\" algorithm.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116117603","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}
M. Horng, Yen-Ching Chan, Y. Kuo, Chia-Ming Yang, Jang-Pong Hsu
In ubiquitous services, concurrent requests from various services for limited service resources such as network bandwidth, easily lead to a problem of resource insufficiency. The resource scheduling for ubiquitous services is the key to improve the tradeoff between request admittance, resource utilization and service quality. In this paper, a GA-based approach to resource scheduling to enable a flexible quality management of ubiquitous services is proposed to solve the problem mentioned above. First, the relationships between service of quality and resource requirements are explored. There are four different types of relations including (1) linear with saturation (LWS), (2) linear with dead zone and saturation (LWDS), (3) shifted step (SS), and (4) exponential (EX). Based on the derivation of the resource-quality model with the four relations, we define the maximum and minimum of resource requirement and regard the scope as the negotiation criterion for quality guarantee in genetic algorithm. Experimental results show that the proposed approach definitely benefits quality guarantee of service and the increasing of service request admittance ratio.
{"title":"A GA-Based Approach to Resource Scheduling Supporting Flexible Quality Management of Ubiquitous Services","authors":"M. Horng, Yen-Ching Chan, Y. Kuo, Chia-Ming Yang, Jang-Pong Hsu","doi":"10.1109/CICN.2011.6","DOIUrl":"https://doi.org/10.1109/CICN.2011.6","url":null,"abstract":"In ubiquitous services, concurrent requests from various services for limited service resources such as network bandwidth, easily lead to a problem of resource insufficiency. The resource scheduling for ubiquitous services is the key to improve the tradeoff between request admittance, resource utilization and service quality. In this paper, a GA-based approach to resource scheduling to enable a flexible quality management of ubiquitous services is proposed to solve the problem mentioned above. First, the relationships between service of quality and resource requirements are explored. There are four different types of relations including (1) linear with saturation (LWS), (2) linear with dead zone and saturation (LWDS), (3) shifted step (SS), and (4) exponential (EX). Based on the derivation of the resource-quality model with the four relations, we define the maximum and minimum of resource requirement and regard the scope as the negotiation criterion for quality guarantee in genetic algorithm. Experimental results show that the proposed approach definitely benefits quality guarantee of service and the increasing of service request admittance ratio.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115650250","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}
The lung itself cannot generate sound if there is no airflow, pressure differences between structures within the thorax. Listening and interpreting lung sounds by a stethoscope had been an important component of screening and diagnosing lung diseases. However this practice has always been vulnerable to poor audibility, inter-observer variations (between different physicians) and poor reproducibility. Lung sound consists of two main types of sound Basic Lung sound and adventitious sound. The timing, repeatability, and shape of crackles are important parameters for diagnosis. In this paper we aim at automatic analysis of lung sounds for wheeze and crackle detection and classification.
{"title":"Analysis of Deformities in Lung Using Short Time Fourier Transform Spectrogram Analysis on Lung Sound","authors":"A. Parkhi, M. Pawar","doi":"10.1109/CICN.2011.35","DOIUrl":"https://doi.org/10.1109/CICN.2011.35","url":null,"abstract":"The lung itself cannot generate sound if there is no airflow, pressure differences between structures within the thorax. Listening and interpreting lung sounds by a stethoscope had been an important component of screening and diagnosing lung diseases. However this practice has always been vulnerable to poor audibility, inter-observer variations (between different physicians) and poor reproducibility. Lung sound consists of two main types of sound Basic Lung sound and adventitious sound. The timing, repeatability, and shape of crackles are important parameters for diagnosis. In this paper we aim at automatic analysis of lung sounds for wheeze and crackle detection and classification.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122052160","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}
Complex and large scale scientific computation problems require high computing machines to process data or jobs which are expensive in terms of money. One most successful and low cost mechanism for acquiring the necessary computation power for such type of application is the Peer-to-Peer computing paradigm, which makes use of the computational power of personal computers. The peer-to-peer (P2P) systems represent the applications that allow direct communication between peers and resource harvesting. In this paper we propose a generic Peer-to-Peer computing system (P2PCS) to process complex and large scale scientific computation problems. The system utilizes the CPU cycles of desktop PCs which are connected to the network to perform the computations. We are implementing this system in JAVA technology by using Sun's JXTA --JXSE 2.5 libraries.
{"title":"P2PCS - A Pure Peer-to-Peer Computing System for Large Scale Computation Problems","authors":"Jigyasu Dubey, V. Tokekar","doi":"10.1109/CICN.2011.126","DOIUrl":"https://doi.org/10.1109/CICN.2011.126","url":null,"abstract":"Complex and large scale scientific computation problems require high computing machines to process data or jobs which are expensive in terms of money. One most successful and low cost mechanism for acquiring the necessary computation power for such type of application is the Peer-to-Peer computing paradigm, which makes use of the computational power of personal computers. The peer-to-peer (P2P) systems represent the applications that allow direct communication between peers and resource harvesting. In this paper we propose a generic Peer-to-Peer computing system (P2PCS) to process complex and large scale scientific computation problems. The system utilizes the CPU cycles of desktop PCs which are connected to the network to perform the computations. We are implementing this system in JAVA technology by using Sun's JXTA --JXSE 2.5 libraries.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121381198","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}
In the financial markets, there are different assets, such as stocks, bonds, foreign exchanges, options, commodities, real estates and future contracts, available for trading. The qualities of these assets vary from very good to extremely poor. Usually, it is difficult for investors to find out those good quality assets because of information asymmetry and asset price fluctuations. Therefore, it is not wise to use portfolio theory blindly for optimizing asset allocation among some low quality assets. The suitable way of constructing a portfolio is to select some good quality assets. Markowitz's portfolio theory only provides a solution to asset selection among the pre-determined assets.
{"title":"Design of Genetic Algorithm for Knapsack Problem to Perform Stock Portfolio Selection Using Financial Indicators","authors":"T. Patalia, Dr. G. R. Kulkarni","doi":"10.1109/CICN.2011.60","DOIUrl":"https://doi.org/10.1109/CICN.2011.60","url":null,"abstract":"In the financial markets, there are different assets, such as stocks, bonds, foreign exchanges, options, commodities, real estates and future contracts, available for trading. The qualities of these assets vary from very good to extremely poor. Usually, it is difficult for investors to find out those good quality assets because of information asymmetry and asset price fluctuations. Therefore, it is not wise to use portfolio theory blindly for optimizing asset allocation among some low quality assets. The suitable way of constructing a portfolio is to select some good quality assets. Markowitz's portfolio theory only provides a solution to asset selection among the pre-determined assets.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128128165","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}
Generic Fourier descriptor yield spectral features and have better retrieval performance due to multi-resolution analysis in both radial and circular directions of the shape. In the proposed work, an automated bamboo species recognition system based on shape features of bamboo culm sheath has been developed using Generic Fourier Moment and compare the result with Hu moment. The performance of the classifier is compared based on the classifier accuracy and conclude that the Fourier moment have significantly good results compare to Hu moment. The results obtained shows considerable recognition accuracy proving that the techniques used is suitable to be implemented for commercial purposes.
{"title":"A Comparison of 2D Moment Based Description Techniques for Classification of Bamboo Plant","authors":"Krishnavir Singh, I. Gupta, Sangeeta Gupta","doi":"10.1109/CICN.2011.4","DOIUrl":"https://doi.org/10.1109/CICN.2011.4","url":null,"abstract":"Generic Fourier descriptor yield spectral features and have better retrieval performance due to multi-resolution analysis in both radial and circular directions of the shape. In the proposed work, an automated bamboo species recognition system based on shape features of bamboo culm sheath has been developed using Generic Fourier Moment and compare the result with Hu moment. The performance of the classifier is compared based on the classifier accuracy and conclude that the Fourier moment have significantly good results compare to Hu moment. The results obtained shows considerable recognition accuracy proving that the techniques used is suitable to be implemented for commercial purposes.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130229039","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}
The problem of image restoration in presence of blur and noise has been a very important problem in the domain of digital image processing and computer vision. A quantum inspired back propagation neural network (QBPNN) architecture based on quantum gates (single qubit rotation gates and two qubit controlled-not gates) has been used and its back propagation learning formulae have been proposed in this article for the task of restoration of images from noisy and blurred perspectives. The superiority of the QBPNN architecture is clearly demonstrated in terms of convergence rate and speed as compared to the classical multilayer perceptron (MLP).
{"title":"Image Restoration Using a Multilayered Quantum Backpropagation Neural Network","authors":"S. Mukherjee, Raka Chowdhury, S. Bhattacharyya","doi":"10.1109/CICN.2011.89","DOIUrl":"https://doi.org/10.1109/CICN.2011.89","url":null,"abstract":"The problem of image restoration in presence of blur and noise has been a very important problem in the domain of digital image processing and computer vision. A quantum inspired back propagation neural network (QBPNN) architecture based on quantum gates (single qubit rotation gates and two qubit controlled-not gates) has been used and its back propagation learning formulae have been proposed in this article for the task of restoration of images from noisy and blurred perspectives. The superiority of the QBPNN architecture is clearly demonstrated in terms of convergence rate and speed as compared to the classical multilayer perceptron (MLP).","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128188710","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
扫码关注我们
求助内容：
应助结果提醒方式：