Sciweavers

960 search results - page 36 / 192
» CURE: An Efficient Clustering Algorithm for Large Databases
Sort
View
LWA
2004
15 years 5 months ago
Efficient Frequent Pattern Mining in Relational Databases
Data mining on large relational databases has gained popularity and its significance is well recognized. However, the performance of SQL based data mining is known to fall behind ...
Xuequn Shang, Kai-Uwe Sattler, Ingolf Geist
205
Voted
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
15 years 7 months ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang
125
Voted
GECCO
2004
Springer
124views Optimization» more  GECCO 2004»
15 years 9 months ago
Clustering with Niching Genetic K-means Algorithm
GA-based clustering algorithms often employ either simple GA, steady state GA or their variants and fail to consistently and efficiently identify high quality solutions (best known...
Weiguo Sheng, Allan Tucker, Xiaohui Liu
EDBT
2009
ACM
132views Database» more  EDBT 2009»
15 years 10 months ago
A novel approach for efficient supergraph query processing on graph databases
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...
Shuo Zhang, Jianzhong Li, Hong Gao, Zhaonian Zou
136
Voted
CORR
2010
Springer
157views Education» more  CORR 2010»
15 years 3 months ago
Efficient Clustering with Limited Distance Information
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model ...
Konstantin Voevodski, Maria-Florina Balcan, Heiko ...