Sciweavers

960 search results - page 16 / 192
» CURE: An Efficient Clustering Algorithm for Large Databases
Sort
View
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
15 years 3 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
DAGM
1999
Springer
15 years 4 months ago
Knowledge Discovery in Spatial Databases
Both, the number and the size of spatial databases, such as geographic or medical databases, are rapidly growing because of the large amount of data obtained from satellite images,...
Martin Ester, Hans-Peter Kriegel, Jörg Sander
TEC
2010
126views more  TEC 2010»
14 years 6 months ago
Learning the Large-Scale Structure of the MAX-SAT Landscape Using Populations
A new algorithm for solving MAX-SAT problems is introduced which clusters good solutions, and restarts the search from the closest feasible solution to the centroid of each cluster...
Mohamed Qasem, Adam Prügel-Bennett
EDBT
2012
ACM
228views Database» more  EDBT 2012»
13 years 2 months ago
Finding maximal k-edge-connected subgraphs from a large graph
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang...
VLDB
1994
ACM
140views Database» more  VLDB 1994»
15 years 3 months ago
Efficient and Effective Clustering Methods for Spatial Data Mining
Spatial data mining is the discovery of interesting relationships and characteristics that may exist implicitly in spatial databases. In this paper, we explore whether clustering ...
Raymond T. Ng, Jiawei Han