Sciweavers

1836 search results - page 229 / 368
» Mining Clustering Dimensions
Sort
View
SDM
2003
SIAM
129views Data Mining» more  SDM 2003»
15 years 5 months ago
Approximate Query Answering by Model Averaging
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
Dmitry Pavlov, Padhraic Smyth
139
Voted
DMIN
2009
142views Data Mining» more  DMIN 2009»
15 years 1 months ago
Efficient Record Linkage using a Double Embedding Scheme
Record linkage is the problem of identifying similar records across different data sources. The similarity between two records is defined based on domain-specific similarity functi...
Noha Adly
ISBI
2008
IEEE
16 years 4 months ago
Defining cortical sulcus patterns using partial clustering based on bootstrap and bagging
The cortical folding patterns are very different from one individual to another. Here we try to find folding patterns automatically using large-scale datasets by non-supervised cl...
Zhong Yi Sun, Denis Rivière, Edouard Duches...
WWW
2004
ACM
16 years 4 months ago
A hierarchical monothetic document clustering algorithm for summarization and browsing search results
Organizing Web search results into a hierarchy of topics and subtopics facilitates browsing the collection and locating results of interest. In this paper, we propose a new hierar...
Krishna Kummamuru, Rohit Lotlikar, Shourya Roy, Ka...
SDM
2009
SIAM
193views Data Mining» more  SDM 2009»
16 years 1 months ago
Agglomerative Mean-Shift Clustering via Query Set Compression.
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...
Xiaotong Yuan, Bao-Gang Hu, Ran He