Sciweavers

1038 search results - page 54 / 208
» A Genetic Algorithm for Clustering on Very Large Data Sets
Sort
View
ICDM
2003
IEEE
99views Data Mining» more  ICDM 2003»
14 years 2 months ago
Scalable Model-based Clustering by Working on Data Summaries
The scalability problem in data mining involves the development of methods for handling large databases with limited computational resources. In this paper, we present a two-phase...
Huidong Jin, Man Leung Wong, Kwong-Sak Leung
SIGMOD
2001
ACM
193views Database» more  SIGMOD 2001»
14 years 8 months ago
Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data
The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The s...
Christian Böhm, Bernhard Braunmüller, Fl...
ESANN
2007
13 years 10 months ago
Self-organized chains for clustering
This paper presents a new algorithm for clustering. It is an generalisation of the K-means algorithms . Each cluster will be represented by a chain of prototypes instead of being r...
Hassan Ghaziri
APVIS
2010
13 years 10 months ago
GMap: Visualizing graphs and clusters as maps
Information visualization is essential in making sense out of large data sets. Often, high-dimensional data are visualized as a collection of points in 2-dimensional space through...
Emden R. Gansner, Yifan Hu, Stephen G. Kobourov
WAW
2004
Springer
178views Algorithms» more  WAW 2004»
14 years 2 months ago
Communities Detection in Large Networks
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
Andrea Capocci, Vito Domenico Pietro Servedio, Gui...