Sciweavers

5046 search results - page 272 / 1010
» Non-redundant data clustering
Sort
View
GECCO
2003
Springer
15 years 12 months ago
Mining Comprehensible Clustering Rules with an Evolutionary Algorithm
In this paper, we present a novel evolutionary algorithm, called NOCEA, which is suitable for Data Mining (DM) clustering applications. NOCEA evolves individuals that consist of a ...
Ioannis A. Sarafis, Philip W. Trinder, Ali M. S. Z...
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
15 years 8 months ago
Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
Richard Matthew McCutchen, Samir Khuller
IJIS
2008
123views more  IJIS 2008»
15 years 6 months ago
Algorithms of nonlinear document clustering based on fuzzy multiset model
Abstract: Fuzzy multiset is applicable as a model of information retrieval because it has the mathematical structure which expresses the number and the degree of attribution of an ...
Kiyotaka Mizutani, Ryo Inokuchi, Sadaaki Miyamoto
ICDM
2010
IEEE
216views Data Mining» more  ICDM 2010»
15 years 4 months ago
K-AP: Generating Specified K Clusters by Efficient Affinity Propagation
Abstract--The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a data set. However, it suffers...
Xiangliang Zhang, Wei Wang, Kjetil Nørv&ari...
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
16 years 7 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis