DOI:​10.1007/s11634-013-0130-x
Corpus ID: 2283430
A clustering ensemble framework based on elite selection of weighted clusters
H. Parvin, B. Minaei-Bidgoli
Published 2013

Mathematics, Computer Science
Advances in Data Analysis and Classification
Each clustering algorithm usually optimizes a qualification metric during its progress. The qualification metric in conventional clustering algorithms considers all the features equally important; in… Expand
View On Springer
Researchgate.Net
Share This Paper




44 Citations
Highly Influential Citations
3
Background Citations
9
Methods Citations
12
Figures, Tables, and Topics from this paper
Figure 1
Table 1
Table 2
Figure 2
Table 3
Figure 3
Figure 4
Table 4
Figure 5
Table 5
Figure 6
Table 6
Figure 7
Table 7
Figure 8
Table 8
Figure 9
Table 9
Table 10
Table 11
Cluster analysis
Algorithm
Artificial intelligence
Email
Selection (genetic algorithm)
Maxima and minima
Computer engineering
Norm (social)
K-means clustering
Adaptive filter
44 Citations
A comprehensive study of clustering ensemble weighting based on cluster quality and diversity
Ahmad Nazari, Ayob Dehghan, S. Nejatian, V. Rezaie, H. Parvin
Computer Science
Pattern Analysis and Applications
2017
TLDR
The proposed framework completely overshadows the state-of-the-art clustering ensemble methods experimentally and proposes cluster-level weighting co-association matrix instead of traditional co-Association matrix. Expand
37 Citations
Clustering ensemble selection considering quality and diversity
Roham Ranjbar, H. Parvin, F. Rad
Computer ScienceArtificial Intelligence Review
2018
TLDR
A criterion is proposed to assess the association between a cluster and a partition which is called Edited Normalized Mutual Information, ENMI criterion and it is shown that the proposed method outperforms other well-known ensembles. Expand
37 Citations
An Ensemble of Locally Reliable Cluster Solutions
Huan Niu, N. Khozouie, H. Parvin, H. Alinejad-Rokny, Amin Beheshti, M. Mahmoudi
Computer Science
2020
Clustering ensemble indicates to an approach in which a number of (usually weak) base clusterings are performed and their consensus clustering is used as the final clustering. Knowing democratic… Expand
Co-Clustering Ensemble Based on Bilateral K-Means Algorithm
H. Yang, Han Peng, Jianyong Zhu, F. Nie
Computer Science, MathematicsIEEE Access
2020
TLDR
A co-clustering ensemble based on bilateral k-means (CEBKM) algorithm that can simultaneously cluster samples and base clusterings of a dataset, and can directly obtain the final clustering results without using other clustering algorithms. Expand
2 Citations
PDF
Weighted Clustering Ensemble: A Review
Mimi Zhang
Computer Science, MathematicsArXiv
2019
TLDR
The unifying framework presented in this paper will help clustering practitioners select the most appropriate weighting mechanisms for their own problems by discussing different types of weights, major approaches to determining weight values, and applications of weighted clustering ensemble to complex data.Expand
3 Citations
PDF
Self-Paced Clustering Ensemble
Peng Zhou, Liang Du, Xinwang Liu, Yi-Dong Shen, Mingyu Fan, Xuejun Li
Computer Science, Medicine
IEEE Transactions on Neural Networks and Learning Systems
2021
TLDR
This work proposes a novel self-paced clustering ensemble (SPCE) method, which gradually involves instances from easy to difficult ones into the ensemble learning, and proposes a joint learning algorithm to obtain the final consensus clustering result.Expand
10 Citations
PDF
A Meta Classifier by Clustering of Classifiers
Mohammad Iman Jamnejad, Sajad Parvin, A. Heidarzadegan, M. Moshki
Computer Science
MICAI

2014
TLDR
This paper proposes an innovative ensemble creation named the Classifier Selection Based on Clustering (CSBC), which guarantees the necessary diversity among ensemble classifiers, using the clustering of classifiers technique.Expand
1 Citation
Optimization of Basic Clustering for Ensemble Clustering: An Information-Theoretic Perspective
Wei-Zhang Liang, Y. Zhang, Jianfeng Xu, Deyu Lin
Computer Science
IEEE Access

2019
The current research on ensemble clustering mainly focuses on integration strategies, but the attention regarding the measurement and optimization of basic cluster is less emphasized. Based on the… Expand
3 Citations
PDF
Hyperplane Division in Fuzzy C-Means: Clustering Big Data
Yinghua Shen, W. Pedrycz, Yuan Chen, Xianmin Wang, A. Gacek
Computer Science
IEEE Transactions on Fuzzy Systems
2020
TLDR
This article proposes an original algorithm referred to as a hyperplane division method to split the entire data set into disjoint subsets, and validates the proposed strategies on both synthetic and publicly available data to show their superiority over the method of clustering the entireData and over some representative big data clustering methods. Expand
3 Citations
Transfer Clustering Ensemble Selection
Yifan Shi, Zhiwen Yu, +4 authors J. Zhang
Medicine, Computer Science
IEEE Transactions on Cybernetics
2020
TLDR
This paper proposes a transfer CES (TCES) algorithm which makes use of the relationship between quality and diversity in a source dataset, and transfers it into a target dataset based on three objective functions, and constructs a transfer CE framework based on TCES to obtain better clustering results. Expand
9 Citations
...
1
2
3
4
...
References
SHOWING 1-10 OF 35 REFERENCES
Clustering through decision tree construction
B. Liu, Yiyuan Xia, Philip S. Yu
Computer Science
CIKM '00

2000
TLDR
A novel clustering technique is proposed, which is based on a supervised learning technique called decision tree construction, that is able to find "natural" clusters in large high dimensional spaces eff iciently and also scales well for large highdimensional datasets. Expand
221 Citations
PDF
Weighted cluster ensembles: Methods and analysis
C. Domeniconi, Muna Al-Razgan
Mathematics, Computer ScienceTKDD
2009
TLDR
This article addresses the problem of combining multiple weighted clusters that belong to different subspaces of the input space to generate a consensus partition that is superior to the participating ones.Expand
Subspace clustering for high dimensional data: a review
Lance Parsons, E. Haque, H. Liu
Computer Science
SKDD

2004
TLDR
A survey of the various subspace clustering algorithms along with a hierarchy organizing the algorithms by their defining characteristics is presented, comparing the two main approaches using empirical scalability and accuracy tests and discussing some potential applications where sub space clustering could be particularly useful. Expand
1,293 Citations
PDF
Entropy-based subspace clustering for mining numerical data
C. Cheng, A. Fu, Yi Zhang
Computer Science
KDD '99

1999
TLDR
This work considers a database with numerical attributes, in which each transaction is viewed as a multi-dimensional vector, and identifies new meaningful criteria of high density and correlation of dimensions for goodness of clustering in subspaces. Expand
591 Citations
Evidence Accumulation Clustering Based on the K-Means Algorithm
A. Fred, Anil K. Jain
Computer Science
SSPR/SPR

2002
TLDR
This paper proposes the combination of multiple K-means clusterings using variable k, using cluster lifetime as the criterion for extracting the final clusters; and the adaptation of this approach to string patterns, which leads to a more robust clustering technique. Expand
93 Citations
PDF
Locally adaptive metrics for clustering high dimensional data
C. Domeniconi, D. Gunopulos, Sheng Ma, B. Yan, Muna Al-Razgan, Dimitris Papadopoulos
Mathematics, Computer Science
Data Mining and Knowledge Discovery
2006
TLDR
An algorithm is introduced that discovers clusters in subspaces spanned by different combinations of dimensions via local weightings of features, whose values capture the relevance of features within the corresponding cluster. Expand
223 Citations
PDF
A new method for hierarchical clustering combination
A. Mirzaei, M. Rahmati, M. Ahmadi
Mathematics, Computer ScienceIntell. Data Anal.
2008
TLDR
A new method for combining hierarchical clustering is proposed and the results show that more accurate results are obtained using hierarchical combination than combination of partitional clusterings. Expand
31 Citations
PDF
Multi-Objective Clustering Ensemble
K. Faceli, A. Carvalho, M. D. Souto
Computer Science
2006 Sixth International Conference on Hybrid Intelligent Systems (HIS'06)
2006
TLDR
An algorithm for cluster analysis that provides a robust way to deal with datasets presenting different types of clusters and allows finding more than one structure in a dataset by applying a Pareto-based multi-objective genetic algorithm with a special crossover operator. Expand
73 Citations
Finding Consistent Clusters in Data Partitions
A. Fred
Computer ScienceMultiple Classifier Systems
2001
TLDR
This paper addresses the problem of finding consistent clusters in data partitions, proposing the analysis of the most common associations performed in a majority voting scheme, and evaluating the proposed methodology in the context of k-means clustering, a new clustering algorithm being presented. Expand
297 Citations
PDF
Combining multiple clusterings using evidence accumulation
A. Fred, Anil K. Jain
Computer Science, Mathematics
IEEE Transactions on Pattern Analysis and Machine Intelligence
2005
TLDR
A theoretical framework for the analysis of the proposed clustering combination strategy and its evaluation is developed, based on the concept of mutual information between data partitions, for extracting a consistent clustering, given the various partitions in a clustering ensemble. Expand
1,016 Citations
PDF
...
1
2
3
4
...
SORT BY
Related Papers
A clustering ensemble framework based on selection of fuzzy weighted clusters in a locally adaptive clustering algorithm
H. Parvin, B. Minaei-Bidgoli
Mathematics, Computer Science
Pattern Analysis and Applications
2013
Each clustering algorithm usually optimizes a qualification metric during its learning process. The qualification metric...
59 Citations
A New Clustering Algorithm with the Convergence Proof
H. Parvin, B. Minaei-Bidgoli, H. Alizadeh
Computer Science
KES

2011
Conventional clustering algorithms employ a set of features; each feature participates in the clustering procedure equiv...
14 Citations
Show More
2/10
Abstract
Figures, Tables, and Topics
44 Citations
35 References
Related Papers
Stay Connected With Semantic Scholar
What Is Semantic Scholar?
Semantic Scholar is a free, AI-powered research tool for scientific literature, based at the Allen Institute for AI.
Learn More
About
About Us
Publishers
Beta Program
Contact
Research
Team
Datasets
Open Corpus
Supp.ai
Resources
Librarians
Tutorials
FAQ
API
Proudly built by AI2
Terms of ServicePrivacy Policy
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE