Pub Date : 2013-05-13DOI: 10.1109/IADCC.2013.6514367
M. Waje, P. Dakhole
Quantum Dot Cellular Automata is one of the six emerging technologies which help us to overcome the limitations of CMOS technology. Design of 4-bit ALU for AND, OR, XOR, and ADD operations using QCA is discussed through this paper. This design of 4-bit ALU using QCA is simple in structure having significantly lesser elements as compared to CMOS design. It also gives better result in terms of speed, area and power. A QCADesigner tool is used for Simulation of different components of 4 bit ALU.
{"title":"Design and implementation of 4-bit arithmetic logic unit using Quantum Dot Cellular Automata","authors":"M. Waje, P. Dakhole","doi":"10.1109/IADCC.2013.6514367","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514367","url":null,"abstract":"Quantum Dot Cellular Automata is one of the six emerging technologies which help us to overcome the limitations of CMOS technology. Design of 4-bit ALU for AND, OR, XOR, and ADD operations using QCA is discussed through this paper. This design of 4-bit ALU using QCA is simple in structure having significantly lesser elements as compared to CMOS design. It also gives better result in terms of speed, area and power. A QCADesigner tool is used for Simulation of different components of 4 bit ALU.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134057285","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514430
S. Kansal, J. Madan, Ashutosh Kumar Singh
One of the most familiar problem in reverse engineering for generating CAD model from point cloud of physical part is presence of deep and narrow holes. Triangulation is one of the important step for generating a CAD model in reverse engineering. Due to formation of incorrect triangulations along the boundary of a hole, reconstruction algorithms are not able to recover the hole boundaries. A systematic approach for CAD model generation of parts with hole features is presented in this paper, which includes three modules of the system: a pre-processing algorithm to reduce the size of point cloud data, surface reconstruction algorithm based on Delaunay triangulation, and post processing algorithm to refine the mesh generated through triangulation. The proposed system is verified on some example parts containing hole features. The results obtained from the proposed system are encouraging and, we intend to implement this on some point cloud data obtained from physically existing parts.
{"title":"A systematic approach for Cad model generation Of hole features from point cloud data","authors":"S. Kansal, J. Madan, Ashutosh Kumar Singh","doi":"10.1109/IADCC.2013.6514430","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514430","url":null,"abstract":"One of the most familiar problem in reverse engineering for generating CAD model from point cloud of physical part is presence of deep and narrow holes. Triangulation is one of the important step for generating a CAD model in reverse engineering. Due to formation of incorrect triangulations along the boundary of a hole, reconstruction algorithms are not able to recover the hole boundaries. A systematic approach for CAD model generation of parts with hole features is presented in this paper, which includes three modules of the system: a pre-processing algorithm to reduce the size of point cloud data, surface reconstruction algorithm based on Delaunay triangulation, and post processing algorithm to refine the mesh generated through triangulation. The proposed system is verified on some example parts containing hole features. The results obtained from the proposed system are encouraging and, we intend to implement this on some point cloud data obtained from physically existing parts.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117279573","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514296
M. Ananthi, M. Sumalatha
Web service supports interoperability for collecting, storing, manipulating and retrieving data from heterogeneous environments. The Wireless Sensor Network is a resource-constrained device, which is low cost, low power and small in size and used in various applications such as industrial control & monitoring, environmental sensing, health care, etc. The main intent is to design a middleware that hides the complexity of accessing the sensor network environment and developing an application for sensor web enablement. This concept holds great importance because integrating wireless sensor network into IP-based systems are still a challenging issue. It is very important to collect patient's details during the emergency period. To create a web service to manage patient's personal data with the help of Radio Frequency Identification Tag (RFID), Web Service is dedicated to collecting, storing, manipulating, and making available clinical information. Context-aware services are needed for searching information more accurately and to produce highly impeccable output.
{"title":"Integrating WSN with web services for patient's record management using RFID","authors":"M. Ananthi, M. Sumalatha","doi":"10.1109/IADCC.2013.6514296","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514296","url":null,"abstract":"Web service supports interoperability for collecting, storing, manipulating and retrieving data from heterogeneous environments. The Wireless Sensor Network is a resource-constrained device, which is low cost, low power and small in size and used in various applications such as industrial control & monitoring, environmental sensing, health care, etc. The main intent is to design a middleware that hides the complexity of accessing the sensor network environment and developing an application for sensor web enablement. This concept holds great importance because integrating wireless sensor network into IP-based systems are still a challenging issue. It is very important to collect patient's details during the emergency period. To create a web service to manage patient's personal data with the help of Radio Frequency Identification Tag (RFID), Web Service is dedicated to collecting, storing, manipulating, and making available clinical information. Context-aware services are needed for searching information more accurately and to produce highly impeccable output.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115457907","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514370
S. Jhodge, G. Chiddarwar, G. Shinde
Face recognition technique nowadays is emerging as the most significant and challenging aspects in terms of security for identification of images in various fields viz. banking, police records, biometric etc. other than an individual's thumb and documented identification proofs. Till date for efficient net banking to be initiated, one has to provide the appropriate user name and password for purpose of authentication. This project introduces a vehicle to take a step forward in easy and more reliable authentication of an individual by providing Face Image along with User Name and Password to the system. In this an individual's face is identified by biometric authentication support with which, only a person whose account is, can access it. However while transferring this sensitive data of user image, from client machine to bank server it has to be protected from hackers and intruders from manhandling it, hence it is transferred using covert communication called Wavelet Decomposition based steganography. As face images are affected by different expressions, poses, occlusions, illuminations and aging over a period of time and it differs from the same person than those from different ones is the main difficult task in face recognition. Whenever image information is jointly co-ordinated in three aspects viz. image space, scale and orientation domains they carry much higher clues than seen in each domain individually. In the proposed method combination of Local Binary Pattern (LBP) and Gabor features are used to increase the face recognition performance significantly to compare individual's face presentations. Hence face recognition and representation of Gabor faces are done using E-GV-LBP and CMI-LDA based feature recognition method. Gabor faces uses space, scale and orientation to support accurate face recognition, making net banking easier, authentic, reliable and user friendly.
{"title":"A new SAFR tool for face recognition using EGVLBP-CMI-LDA wrapped with secured DWT based steganography","authors":"S. Jhodge, G. Chiddarwar, G. Shinde","doi":"10.1109/IADCC.2013.6514370","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514370","url":null,"abstract":"Face recognition technique nowadays is emerging as the most significant and challenging aspects in terms of security for identification of images in various fields viz. banking, police records, biometric etc. other than an individual's thumb and documented identification proofs. Till date for efficient net banking to be initiated, one has to provide the appropriate user name and password for purpose of authentication. This project introduces a vehicle to take a step forward in easy and more reliable authentication of an individual by providing Face Image along with User Name and Password to the system. In this an individual's face is identified by biometric authentication support with which, only a person whose account is, can access it. However while transferring this sensitive data of user image, from client machine to bank server it has to be protected from hackers and intruders from manhandling it, hence it is transferred using covert communication called Wavelet Decomposition based steganography. As face images are affected by different expressions, poses, occlusions, illuminations and aging over a period of time and it differs from the same person than those from different ones is the main difficult task in face recognition. Whenever image information is jointly co-ordinated in three aspects viz. image space, scale and orientation domains they carry much higher clues than seen in each domain individually. In the proposed method combination of Local Binary Pattern (LBP) and Gabor features are used to increase the face recognition performance significantly to compare individual's face presentations. Hence face recognition and representation of Gabor faces are done using E-GV-LBP and CMI-LDA based feature recognition method. Gabor faces uses space, scale and orientation to support accurate face recognition, making net banking easier, authentic, reliable and user friendly.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123039799","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514258
M. Dutta, A. K. Singh, A. Kumar
In this paper, an efficient signcryption scheme based on elliptic curve cryptosystem is going to be proposed which can effectively combine the functionalities of digital signature and encryption and also takes a comparable amount of computational cost and communication overhead. The proposed scheme provides confidentiality, integrity, unforgeability and nonrepudiation, along with encrypted message authentication, forward secrecy of message confidentiality and public verification. By forward secrecy of message confidentiality function we mean, although the private key of the sender is divulged inattentively, it does not affect the confidentiality of the previously stored messages. By the public verification function we mean, any third party can verify directly the signature of the sender of the original message without the sender's private key when dispute occurs. It enhances the justice of judge. In addition, proposed scheme will save great amount of computational cost. The proposed scheme can be applied to the lower computational power devices, like smart card based applications, e-voting and many more, due to their lower computational cost. The Proposed Scheme is discussed in this paper and is compared with the existing schemes with respect to computational cost and the security functions it provides.
{"title":"An efficient signcryption scheme based on ECC with forward secrecy and encrypted message authentication","authors":"M. Dutta, A. K. Singh, A. Kumar","doi":"10.1109/IADCC.2013.6514258","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514258","url":null,"abstract":"In this paper, an efficient signcryption scheme based on elliptic curve cryptosystem is going to be proposed which can effectively combine the functionalities of digital signature and encryption and also takes a comparable amount of computational cost and communication overhead. The proposed scheme provides confidentiality, integrity, unforgeability and nonrepudiation, along with encrypted message authentication, forward secrecy of message confidentiality and public verification. By forward secrecy of message confidentiality function we mean, although the private key of the sender is divulged inattentively, it does not affect the confidentiality of the previously stored messages. By the public verification function we mean, any third party can verify directly the signature of the sender of the original message without the sender's private key when dispute occurs. It enhances the justice of judge. In addition, proposed scheme will save great amount of computational cost. The proposed scheme can be applied to the lower computational power devices, like smart card based applications, e-voting and many more, due to their lower computational cost. The Proposed Scheme is discussed in this paper and is compared with the existing schemes with respect to computational cost and the security functions it provides.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123381640","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514317
N. Dey, B. Nandi, M. Dey, D. Biswas, A. Das, S. S. Chaudhuri
Biometric Authentication System used for verifying identity of a person is getting highly popularized. In today's world when online communication and transactions are a widespread reality, verification of user's identity has become all the more challenging. Biometric Authentication provides a secured and robust system for verification purpose. This paper proposes a cancelable biometric approach called BioHashing. The method uses ECG features and Tokenized Random Number to generate an inner product. The obtained products which are above a previously defined threshold are coded as 1, and the rest 0, thus generating the BioHash Code.
{"title":"BioHash code generation from electrocardiogram features","authors":"N. Dey, B. Nandi, M. Dey, D. Biswas, A. Das, S. S. Chaudhuri","doi":"10.1109/IADCC.2013.6514317","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514317","url":null,"abstract":"Biometric Authentication System used for verifying identity of a person is getting highly popularized. In today's world when online communication and transactions are a widespread reality, verification of user's identity has become all the more challenging. Biometric Authentication provides a secured and robust system for verification purpose. This paper proposes a cancelable biometric approach called BioHashing. The method uses ECG features and Tokenized Random Number to generate an inner product. The obtained products which are above a previously defined threshold are coded as 1, and the rest 0, thus generating the BioHash Code.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122088484","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514462
R. K. Yadav, S. Das, R. L. Yadava
This paper presents design and optimization of DGS based Pentagonal and Circular patch antennas suitable for wireless communication systems. The obtained results are impressive due to its improved bandwidth which covers wide frequency range having return loss less than -10 dB. Also found that Pentagonal antennas have better BW compare to Circular antennas.
{"title":"DGS based microstrip patch antennas for UWB systems","authors":"R. K. Yadav, S. Das, R. L. Yadava","doi":"10.1109/IADCC.2013.6514462","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514462","url":null,"abstract":"This paper presents design and optimization of DGS based Pentagonal and Circular patch antennas suitable for wireless communication systems. The obtained results are impressive due to its improved bandwidth which covers wide frequency range having return loss less than -10 dB. Also found that Pentagonal antennas have better BW compare to Circular antennas.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"335 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122540253","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514309
N. Srivastav, R. Challa
The threat from spammers, attackers and criminal enterprises has grown with the expansion of Internet, thus, intrusion detection systems (IDS)have become a core component of computer network due to prevalence of such threats. In this paper, we present layered framework integrated with neural network to build an effective intrusion detection system. This system has experimented with Knowledge Discovery & Data Mining(KDD) 1999 dataset. The systems are compared with existing approaches of intrusion detection which either uses neural network or based on layered framework. The results show that the proposed system has high attack detection accuracy and less false alarm rate.
{"title":"Novel intrusion detection system integrating layered framework with neural network","authors":"N. Srivastav, R. Challa","doi":"10.1109/IADCC.2013.6514309","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514309","url":null,"abstract":"The threat from spammers, attackers and criminal enterprises has grown with the expansion of Internet, thus, intrusion detection systems (IDS)have become a core component of computer network due to prevalence of such threats. In this paper, we present layered framework integrated with neural network to build an effective intrusion detection system. This system has experimented with Knowledge Discovery & Data Mining(KDD) 1999 dataset. The systems are compared with existing approaches of intrusion detection which either uses neural network or based on layered framework. The results show that the proposed system has high attack detection accuracy and less false alarm rate.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130182283","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514204
Ramanathan Mohan, Rao Kovvur, S. Ramachandram, Vijayakumar Kadappa, A. Govardhan
We consider scheduling of bag of independent mixed tasks (Hard, firm and soft) in a distributed dynamic grid environment. Recently, a general distributed scalable grid scheduler (GDS) for independent tasks was proposed to maximize successful schedule percent in an error-free grid environment. However, GDS did not consider constraint failure of task during execution due to resource overload, which leads to limited successful schedule percent. In this paper, we propose a novel distributed dynamic grid scheduler for mixed tasks (DDGS-MT), which takes into consideration the constraint failure of task during execution due to resource overload. The proposed scheduler incorporates migration and resume fault tolerant mechanisms for computational and communication intensive tasks respectively. The proposed scheduler shows improved performance in terms of successful schedule percent and makespan in comparison with GDS. The results of our exhaustive simulations experiments demonstrate the superiority of DDGS over GDS scheduler.
{"title":"A distributed dynamic grid scheduler for mixed tasks","authors":"Ramanathan Mohan, Rao Kovvur, S. Ramachandram, Vijayakumar Kadappa, A. Govardhan","doi":"10.1109/IADCC.2013.6514204","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514204","url":null,"abstract":"We consider scheduling of bag of independent mixed tasks (Hard, firm and soft) in a distributed dynamic grid environment. Recently, a general distributed scalable grid scheduler (GDS) for independent tasks was proposed to maximize successful schedule percent in an error-free grid environment. However, GDS did not consider constraint failure of task during execution due to resource overload, which leads to limited successful schedule percent. In this paper, we propose a novel distributed dynamic grid scheduler for mixed tasks (DDGS-MT), which takes into consideration the constraint failure of task during execution due to resource overload. The proposed scheduler incorporates migration and resume fault tolerant mechanisms for computational and communication intensive tasks respectively. The proposed scheduler shows improved performance in terms of successful schedule percent and makespan in comparison with GDS. The results of our exhaustive simulations experiments demonstrate the superiority of DDGS over GDS scheduler.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129680448","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514316
K. R. Prasad, B. E. Reddy
Clustering analysis is widely used technique in many emerging applications. Assessment of clustering tendency is generally done by Visual Access Tendency (VAT) algorithm. VAT detects the clustering tendency by reordering the indices of objects from the dissimilarity matrix, according to logic of Prim's algorithm. Therefore, VAT demands high computational cost for large datasets. The contribution of proposed work is to develop best sampling technique for obtaining good representative of entire dataset in the form of sub-dissimilarity matrix in VAT, it provides accessing of prior tendency visually by detecting number of square shaped dark blocks along with diagonal in sample based VAT image. This proposed work gives same clustering tendency results when we compare with simple VAT, and it has an advantage of less processing time since it uses only sampled dissimilarity matrix. This sample based VAT (PSVAT) uses set of distinguished features for random selection of progressive sample representatives. Finally, known clustering tendency is used in graph-based clustering technique (Minimum Spanning Tree based clustering) for achieving efficient clustering results. Comparative runtime values of PSVAT and VAT on several datasets are presented in this paper for showing that PSVAT is better than VAT in respect of runtime performance and clustering validity is also tested by Dunn's Index for sampled data.
{"title":"Assessment of clustering tendency through progressive random sampling and graph-based clustering results","authors":"K. R. Prasad, B. E. Reddy","doi":"10.1109/IADCC.2013.6514316","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514316","url":null,"abstract":"Clustering analysis is widely used technique in many emerging applications. Assessment of clustering tendency is generally done by Visual Access Tendency (VAT) algorithm. VAT detects the clustering tendency by reordering the indices of objects from the dissimilarity matrix, according to logic of Prim's algorithm. Therefore, VAT demands high computational cost for large datasets. The contribution of proposed work is to develop best sampling technique for obtaining good representative of entire dataset in the form of sub-dissimilarity matrix in VAT, it provides accessing of prior tendency visually by detecting number of square shaped dark blocks along with diagonal in sample based VAT image. This proposed work gives same clustering tendency results when we compare with simple VAT, and it has an advantage of less processing time since it uses only sampled dissimilarity matrix. This sample based VAT (PSVAT) uses set of distinguished features for random selection of progressive sample representatives. Finally, known clustering tendency is used in graph-based clustering technique (Minimum Spanning Tree based clustering) for achieving efficient clustering results. Comparative runtime values of PSVAT and VAT on several datasets are presented in this paper for showing that PSVAT is better than VAT in respect of runtime performance and clustering validity is also tested by Dunn's Index for sampled data.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128028143","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
扫码关注我们
求助内容：
应助结果提醒方式：