Open Access Open Access  Restricted Access Subscription or Fee Access

Enhancements in Accuracy and Computation Time of Spectral Clustering

Lovepreet Kaur, Neena Madan

Abstract


The spectral clustering is the clustering technique which cluster similar and dissimilar elements according to the dataset elements. The various techniques have been proposed to cluster similar and dissimilar data using spectral clustering. Among various techniques affinity matrices, mean shift algorithm are used to create similarity graphs and normalized algorithm is applied to cluster data. It has been analyzed that due to single use of normalization, cluster quality is reduced as some of the data points remain un-clustered. To improve cluster quality of the algorithm, Shi & Malik is used as normalization algorithm which leads to improve cluster quality and reduction in processing time.

Keywords


Accuracy, CLARAN, Computation Time, Multiway Normalized Cut Criterion, Similarity Based Clustering,

Full Text:

PDF

References


Anwiti Jain, Anand Rajavat, and Rupali Bhartiya,“ Design, analysis and implementation of modified K-mean algorithm for large data-set to increase scalability and efficiency”, Fourth international conference on computational intelligence and communication networks 2012.

David Benson Margart Bonafardin Meagan and Dianel, “ Spectral clustering and visualization : Novel technique for fisher’s Iris Data Set”, SIAM

Hao Huang Yunjun Gao, Kevin Chiew Lei Chen Qinming He, “Towards Effective and Efficient Mining of Arbitrary Shaped Clusters”, ICDE Conference, IEEE 2014

K.Krishna and Raghu, “A clustering algorithm for asymmetrically related data with applications to text mining”, ACM, New York, USA, 2001

Ling Huang, Donghui Yan, Michael I. Jordan and Nina Talt, “Spectral Clustering with Perturbed Data”, 2011

Ming-Chuan Hung & Don-Lin Yang, “An Efficient Fuzzy k-Means Clustering Algorithm”, in proceedings of the IEEE conference on Data mining,pp.225-232, 2002

Scott White and Padhraic Smyth, “A Spectral Clustering Approach To Finding Communities in Graphs”, National Defence Science and Engineering, 2012

Shital A. Raut and S. R. Sathe, “A Modified Fastmap K-Means Clustering Algorithm for Large Scale Gene Expression Datasets”, International Journal of Bioscience, Biochemistry and Bioinformatics, Vol. 1, No. 4, November 2011.

S.R.Pande, Ms..S.S. Sambare, V.M. Thakre,” Data Clustering Using Data Mining Techniques”, IJARCCE Vol. 1, issue 8, October 2012

Sumuya Borjigin and Chonghui Guo ,“Non-Unique cluster number determination method based on stability in spectral clustering”, Knowl Info System , 36:439-458, 2013

Yan Gu , “ECON: An Approach to Extract Content from Web News Page” 12th International Asia-Pacific Web Conference,2012

Yun Chi Xiaodan Song Dengyong Zhou Koji Hino and Belle L. Tseng, “Evolutionary Spectral Clustering by Incorporating Temporal Smoothness”, KDD’07, August 12–15, 2007, San ACM 978-1-59593-609-7

Z. Volkovich, D. Toledano-Kitai, G.-W. Weber, “Self-learning K-means clustering: a global optimization Approach”, © Springer Science Business Media, 7 February 2012.

R. Kannan, S. Vempala, A. Vetta, “On Clusterings: Good, Bad and Spectral,” Proceedings of the IEEE Foundations of Computer Science, pp. 367-377, 2000.

D. J. Higham, M. Kibble, “A Unified View of Spectral Clustering,” Technical Report 02, University of Strathclyde, Department of Mathematics, 2004.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.