Sciweavers

3245 search results - page 56 / 649
» Mining Transformed Data Sets
Sort
View
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
15 years 1 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
SDM
2011
SIAM
242views Data Mining» more  SDM 2011»
14 years 19 days ago
Fast Algorithms for Finding Extremal Sets
Identifying the extremal (minimal and maximal) sets from a collection of sets is an important subproblem in the areas of data-mining and satisfiability checking. For example, ext...
Roberto J. Bayardo, Biswanath Panda
ICDM
2009
IEEE
137views Data Mining» more  ICDM 2009»
15 years 4 months ago
Set-Based Boosting for Instance-Level Transfer
—The success of transfer to improve learning on a target task is highly dependent on the selected source data. Instance-based transfer methods reuse data from the source tasks to...
Eric Eaton, Marie desJardins
AUSDM
2008
Springer
235views Data Mining» more  AUSDM 2008»
14 years 12 months ago
ShrFP-Tree: An Efficient Tree Structure for Mining Share-Frequent Patterns
Share-frequent pattern mining discovers more useful and realistic knowledge from database compared to the traditional frequent pattern mining by considering the non-binary frequen...
Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer,...
PKDD
2009
Springer
113views Data Mining» more  PKDD 2009»
15 years 4 months ago
Feature Selection for Density Level-Sets
A frequent problem in density level-set estimation is the choice of the right features that give rise to compact and concise representations of the observed data. We present an e...
Marius Kloft, Shinichi Nakajima, Ulf Brefeld