Sciweavers

553 search results - page 74 / 111
» A Compress-Based Association Mining Algorithm for Large Data...
Sort
View
DAWAK
2006
Springer
15 years 1 months ago
A Greedy Approach to Concurrent Processing of Frequent Itemset Queries
We consider the problem of concurrent execution of multiple frequent itemset queries. If such data mining queries operate on overlapping parts of the database, then their overall I...
Pawel Boinski, Marek Wojciechowski, Maciej Zakrzew...
KDD
2002
ACM
166views Data Mining» more  KDD 2002»
15 years 10 months ago
Frequent term-based text clustering
Text clustering methods can be used to structure large sets of text or hypertext documents. The well-known methods of text clustering, however, do not really address the special p...
Florian Beil, Martin Ester, Xiaowei Xu
SDM
2004
SIAM
207views Data Mining» more  SDM 2004»
14 years 11 months ago
BAMBOO: Accelerating Closed Itemset Mining by Deeply Pushing the Length-Decreasing Support Constraint
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
Jianyong Wang, George Karypis
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
ACML
2009
Springer
15 years 2 months ago
Learning Algorithms for Domain Adaptation
A fundamental assumption for any machine learning task is to have training and test data instances drawn from the same distribution while having a sufficiently large number of tra...
Manas A. Pathak, Eric Nyberg