Sciweavers

296 search results - page 33 / 60
» Privacy-preserving algorithms for distributed mining of freq...
Sort
View
ML
2010
ACM
210views Machine Learning» more  ML 2010»
13 years 7 months ago
Mining frequent closed rooted trees
Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There ...
José L. Balcázar, Albert Bifet, Anto...
ADBIS
2004
Springer
133views Database» more  ADBIS 2004»
14 years 2 months ago
Evaluation of the Mine-Merge Method for Data Mining Query Processing
In this paper we consider concurrent execution of multiple data mining queries in the context of discovery of frequent itemsets. If such data mining queries operate on similar part...
Marek Wojciechowski, Maciej Zakrzewicz
KDD
2008
ACM
135views Data Mining» more  KDD 2008»
14 years 9 months ago
Effective and efficient itemset pattern summarization: regression-based approaches
In this paper, we propose a set of novel regression-based approaches to effectively and efficiently summarize frequent itemset patterns. Specifically, we show that the problem of ...
Ruoming Jin, Muad Abu-Ata, Yang Xiang, Ning Ruan
CIB
2004
57views more  CIB 2004»
13 years 9 months ago
Identifying Global Exceptional Patterns in Multi-database Mining
In multi-database mining, there can be many local patterns (frequent itemsets or association rules) in each database. At the end of multi-database mining, it is necessary to analyz...
Chengqi Zhang, Meiling Liu, Wenlong Nie, Shichao Z...
ICDM
2010
IEEE
164views Data Mining» more  ICDM 2010»
13 years 7 months ago
On Finding Similar Items in a Stream of Transactions
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similar...
Andrea Campagna, Rasmus Pagh