Association rule mining in peer-to-peer systems

R Wolff, A Schuster - IEEE Transactions on Systems, Man, and …, 2004 - ieeexplore.ieee.org
We extend the problem of association rule mining-a key data mining problem-to systems in
which the database is partitioned among a very large number of computers that are …

Frequent pattern mining on message passing multiprocessor systems

A Javed, A Khokhar - Distributed and Parallel Databases, 2004 - Springer
Extraction of frequent patterns in transaction-oriented database is crucial to several data
mining tasks such as association rule generation, time series analysis, classification, etc …

Parallel tree-projection-based sequence mining algorithms

V Guralnik, G Karypis - Parallel Computing, 2004 - Elsevier
Discovery of sequential patterns is becoming increasingly useful and essential in many
scientific and commercial domains. Enormous sizes of available datasets and possibly large …

Parallel and distributed methods for incremental frequent itemset mining

ME Otey, S Parthasarathy, C Wang… - … on Systems, Man …, 2004 - ieeexplore.ieee.org
Traditional methods for data mining typically make the assumption that the data is
centralized, memory-resident, and static. This assumption is no longer tenable. Such …

[图书][B] Learning classifiers from distributed, semantically heterogeneous, autonomous data sources

D Caragea - 2004 - search.proquest.com
Recent advances in computing, communications, and digital storage technologies, together
with development of high throughput data acquisition technologies have made it possible to …

Paradualminer: An efficient parallel implementation of the dualminer algorithm

RMH Ting, J Bailey, K Ramamohanarao - Advances in Knowledge …, 2004 - Springer
Constraint based mining finds all itemsets that satisfy a set of predicates. Many constraints
can be categorised as being either monotone or antimonotone. Dualminer was the first …

Efficiently mining frequent itemsets from very large databases

J Zhu - 2004 - spectrum.library.concordia.ca
Efficient algorithms for mining frequent itemsets are crucial for mining association rules and
for other data mining tasks. Methods for mining frequent itemsets and for iceberg data cube …

CONQUEST: A Distributed Tool for Constructing Summaries of High-Dimensional Discrete Attributed Datasets

J Chi, M Koyutürk, A Grama - Proceedings of the 2004 SIAM International …, 2004 - SIAM
The problem of constructing bounded-error summaries of binary attributed data of very high
dimensions is an important and difficult one. These summaries enable more expensive …

[PDF][PDF] Using distinct information channels for a hybrid web recommender system

J Li - 2004 - era.library.ualberta.ca
First and foremost, my deepest thanks to my supervisor, Dr. Osmar R. Zaiane for his
invaluable advice and support. His guidance is always insightful, and his patience is highly …

[PDF][PDF] Efficient Mining of Interesting Emerging Patterns and Their Effective Use in Classification

FAN Hongjian - 2004 - Citeseer
Abstract Knowledge Discovery in Databases (KDD), or Data Mining is used to discover
interesting or useful patterns and relationships in data, with an emphasis on large volume of …