Sciweavers

1038 search results - page 22 / 208
» A Genetic Algorithm for Clustering on Very Large Data Sets
Sort
View
SIGMOD
2000
ACM
165views Database» more  SIGMOD 2000»
14 years 29 days ago
Finding Generalized Projected Clusters In High Dimensional Spaces
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
Charu C. Aggarwal, Philip S. Yu
CORR
2010
Springer
279views Education» more  CORR 2010»
13 years 8 months ago
Mining Frequent Itemsets Using Genetic Algorithm
In general frequent itemsets are generated from large data sets by applying association rule mining algorithms like Apriori, Partition, Pincer-Search, Incremental, Border algorithm...
Soumadip Ghosh, Sushanta Biswas, Debasree Sarkar, ...
ICDE
1999
IEEE
139views Database» more  ICDE 1999»
14 years 10 months ago
Clustering Large Datasets in Arbitrary Metric Spaces
Clustering partitions a collection of objects into groups called clusters, such that similar objects fall into the same group. Similarity between objects is defined by a distance ...
Venkatesh Ganti, Raghu Ramakrishnan, Johannes Gehr...
NIPS
2004
13 years 10 months ago
Efficient Out-of-Sample Extension of Dominant-Set Clusters
Dominant sets are a new graph-theoretic concept that has proven to be relevant in pairwise data clustering problems, such as image segmentation. They generalize the notion of a ma...
Massimiliano Pavan, Marcello Pelillo
ICDM
2003
IEEE
71views Data Mining» more  ICDM 2003»
14 years 1 months ago
Tree-structured Partitioning Based on Splitting Histograms of Distances
We propose a novel clustering algorithm that is similar in spirit to classification trees. The data is recursively split using a criterion that applies a discrete curve evolution...
Longin Jan Latecki, Rajagopal Venugopal, Marc Sobe...