research-article

A Clustering Algorithm based on Internal Constrained Multi-view K-means

Authors:

Changyou ZhangAuthors Info & Claims

ChineseCSCW '17: Proceedings of the 12th Chinese Conference on Computer Supported Cooperative Work and Social Computing

Pages 137 - 144

https://doi.org/10.1145/3127404.3127414

Published: 22 September 2017 Publication History

Abstract

As more and more multi-view data are collected, how to apply the traditional clustering algorithm to multi-view data has been studied widely. Among them, the K-means clustering algorithm is extended because of its efficiency on large-scale datasets. Based on the K-means clustering algorithm and the multi-view data without domain knowledge, this paper presents a clustering algorithm based on internal constrained multi-view K-means (ICMK). This paper also evaluates the proposed method on three standard datasets (digits dataset, IS dataset, WTP dataset), and compares with some baseline methods. The experiment results show that ICMK can produce a good view interaction structure automatically and higher quality clustering results.

References

[1]

Cai X, Nie F, Huang H. Multi-view k-means clustering on big data{C}//Proceedings of the Twenty-Third international joint conference on Artificial Intelligence. AAAI Press, 2013: 2598--2604.

Digital Library

[2]

Wu Guoxin, Liu Bingquan, Liu Ming. An Improved Multi-view K-means Clustering Algorithm{A}//TP181:2095--2163(2014)03-0011-05

[3]

Jiang B, Qiu F, Wang L, et al. Bi-level weighted multi-view clustering via hybrid particle swarm optimization{J}. Information Processing & Management, 2016, 52(3):387--398.

Digital Library

[4]

Shi H, Li Y, Han Ym, et al. Cluster structure perserving unsupervised feature selection for multi-view tasks{J}. Neurocomputing, 2016, 175(29):686--697.

Digital Library

[5]

Xu Y M, Wang C D, Lai J H. Weighted Multi-view Clulstering with Feature Selection{J}. Pattern Recognition, 2015., 53(1)25--35.

Digital Library

[6]

Chikhi N F. Multi-view clustering via spectral partitioning and local refinement{J}. Information Processing & Management, 2016, 52(4):618--627.

Digital Library

[7]

Apinantanakon W, Sunat K. A two-stage SOM for noise reduction in SOM map{C}. Computer Science and Engineering Conference(ICSEC), 2014 International. IEEE, 2015:198--202.

[8]

Bickel S, Scheffer T. Multi-View Clustering{C}//ICDM. 2004:19--26.

Digital Library

[9]

Xiie X, Sun S. Multi-view clustering ensembles{C}//Proceedings of the IEEE 2013 International Conference on Machine Learning and Cybernetics(ICMLC).2013:51--56.

[10]

Ng R, Han J. Efficient and Effective Clustering Methods for Spatial Data Mining{C}//Proceeding's of the 20th VLDB Conference. Santiago, Chile, 1994

Digital Library

[11]

Chapelle O, Sch Lkopf B, Zien Am Semi-Supervised Learning: Citeseer, 2006

[12]

Blum A, Mitchell T, Combining Labeled and Unlabeled Data with Co-Training, Proceedings of the eleventh annual conference on Computational learning theory: ACM, 1998, 100

Digital Library

[13]

Cleuziou G, Exbrayat M, Martin L, et al. CoFKM: A Centralized Method for Multiple-View Clustering{C}. IEEE International Conference on Data Mining. IEEE Computer Society, 2010:752--757.

Digital Library

[14]

Sun S. A survey of multi-view machine learning{J}. Neural Computing and Applications, 2013, 23(7-8):2031--2038.

[15]

de Sa V R. Spectral clustering with two views{C}//ICML Workshop on Learning With Multiple Views, 2005

[16]

Bisson G, Gramal C. Co-clustering of multi-view datasets: a parallelizable approach{C}//ICDM, 2012: 828--833

Digital Library

[17]

Bickel S, Scheffer T. Multi-view clustering{C}//ICDM, 2004, 4:19--26.

Digital Library

[18]

Greene D, Cunningham P. A matrix factorization approach for intergrating multiple data views{M}.Machine Learning and Knowledge Discovery in Databases. Springer Berlin Heidelberg, 2009:423--438.

[19]

Ding C, He X, Simon H D. Nonnegative Lagrangian relaxation of K-kmeans and spectral clustering{M}. Machine Learning: ECML 2005. Springer Berlin Heidelberg, 2005:530--538.

Digital Library

[20]

Tang Donog-ming. Affinity propagation clustering for big data based on Hadoop{J}. Computer Engineering and Applications, 2015, 51(4); 29--34.

[21]

Manning C D, Raghavan P, Schutze H. Introduction to information retrieval {M}. Cambridge: Cambridge University Press, 2008.

Digital Library

[22]

Ng A Y, Jordan M I, Weiss Y. On spectral clustering analysis and algorithm {J}. Proceedings of Advances in Neural Information Processing Systems. Cambridge, MA: MIT Press, 2001, 14:849--856.

Digital Library

[23]

Kumar A, Daume H. A co-training approach for multi-view spectral clustering {C} //Proceedings of the Eleventh Annual Conference on Computational Learning Theory. ACM, 1998:92--100.

Cited By

Li W(2024)Design of Intelligent Elderly Care Positioning Management System Based on Apriori AlgorithmProceedings of the International Conference on Algorithms, Software Engineering, and Network Security10.1145/3677182.3677259(435-439)Online publication date: 26-Apr-2024
https://dl.acm.org/doi/10.1145/3677182.3677259
Shi LZhang CYang SWu WBo WMa J(2023)ShapeRef: A Representation Method of Industrial Abnormal Time-Series Waveform Based on Shape Reference2023 IEEE International Conference on Systems, Man, and Cybernetics (SMC)10.1109/SMC53992.2023.10394085(578-583)Online publication date: 1-Oct-2023
https://doi.org/10.1109/SMC53992.2023.10394085
Wang TGao J(2019)An Improved K-Means Algorithm Based on Kurtosis TestJournal of Physics: Conference Series10.1088/1742-6596/1267/1/0120271267(012027)Online publication date: 17-Jul-2019
https://doi.org/10.1088/1742-6596/1267/1/012027

Index Terms

A Clustering Algorithm based on Internal Constrained Multi-view K-means
1. Theory of computation
  1. Theory and algorithms for application domains
    1. Machine learning theory
      1. Unsupervised learning and clustering

Recommendations

Structured multi-view k-means clustering
Abstract
K-means is a very efficient clustering method and many multi-view k-means clustering methods have been proposed for multi-view clustering during the past decade. However, since k-means have trouble uncovering clusters of varying sizes and ...
Ant clustering algorithm with K-harmonic means clustering

Clustering is an unsupervised learning procedure and there is no a prior knowledge of data distribution. It organizes a set of objects/data into similar groups called clusters, and the objects within one cluster are highly similar and dissimilar with ...
Improving a Centroid-Based Clustering by Using Suitable Centroids from Another Clustering
Abstract
Fast centroid-based clustering algorithms such as k-means usually converge to a local optimum. In this work, we propose a method for constructing a better clustering from two such suboptimal clustering solutions based on the fact that each ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

ChineseCSCW '17: Proceedings of the 12th Chinese Conference on Computer Supported Cooperative Work and Social Computing

September 2017

269 pages

ISBN:9781450353526

DOI:10.1145/3127404

General Chairs:
Zili Zhang,
Ning Gu,
Program Chairs:
Shaozi Li,
Tun Lu,
Li Li

Copyright © 2017 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 September 2017

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Conference

ChineseCSCW '17

ChineseCSCW '17: Chinese Conference on Computer Supported Cooperative Work and Social Computing

September 22 - 23, 2017

Chongqing, China

Acceptance Rates

ChineseCSCW '17 Paper Acceptance Rate 21 of 84 submissions, 25%;

Overall Acceptance Rate 21 of 84 submissions, 25%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
227
Total Downloads

Downloads (Last 12 months)23
Downloads (Last 6 weeks)1

Reflects downloads up to 10 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Li W(2024)Design of Intelligent Elderly Care Positioning Management System Based on Apriori AlgorithmProceedings of the International Conference on Algorithms, Software Engineering, and Network Security10.1145/3677182.3677259(435-439)Online publication date: 26-Apr-2024
https://dl.acm.org/doi/10.1145/3677182.3677259
Shi LZhang CYang SWu WBo WMa J(2023)ShapeRef: A Representation Method of Industrial Abnormal Time-Series Waveform Based on Shape Reference2023 IEEE International Conference on Systems, Man, and Cybernetics (SMC)10.1109/SMC53992.2023.10394085(578-583)Online publication date: 1-Oct-2023
https://doi.org/10.1109/SMC53992.2023.10394085
Wang TGao J(2019)An Improved K-Means Algorithm Based on Kurtosis TestJournal of Physics: Conference Series10.1088/1742-6596/1267/1/0120271267(012027)Online publication date: 17-Jul-2019
https://doi.org/10.1088/1742-6596/1267/1/012027

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten