Sciweavers

147 search results - page 6 / 30
» Constraint-Based Rule Mining in Large, Dense Databases
Sort
View
SBACPAD
2003
IEEE
180views Hardware» more  SBACPAD 2003»
15 years 3 months ago
New Parallel Algorithms for Frequent Itemset Mining in Very Large Databases
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
Adriano Veloso, Wagner Meira Jr., Srinivasan Parth...
SAC
2011
ACM
14 years 23 days ago
RuleGrowth: mining sequential rules common to several sequences by pattern-growth
Mining sequential rules from large databases is an important topic in data mining fields with wide applications. Most of the relevant studies focused on finding sequential rules a...
Philippe Fournier-Viger, Roger Nkambou, Vincent Sh...
KDD
1997
ACM
135views Data Mining» more  KDD 1997»
15 years 2 months ago
Brute-Force Mining of High-Confidence Classification Rules
This paper investigates a brute-force technique for mining classification rules from large data sets. We employ an association rule miner enhanced with new pruning strategies to c...
Roberto J. Bayardo Jr.
WWW
2005
ACM
15 years 10 months ago
XAR-miner: efficient association rules mining for XML data
In this paper, we propose a framework, called XAR-Miner, for mining ARs from XML documents efficiently. In XAR-Miner, raw data in the XML document are first preprocessed to transf...
Sheng Zhang, Ji Zhang, Han Liu, Wei Wang
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
15 years 10 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han