Sciweavers

2497 search results - page 150 / 500
» A Partial-Repeatability Approach to Data Mining
Sort
View
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.
COMPUTE
2010
ACM
15 years 2 months ago
Mining periodic-frequent patterns with maximum items' support constraints
The single minimum support (minsup) based frequent pattern mining approaches like Apriori and FP-growth suffer from“rare item problem”while extracting frequent patterns. That...
R. Uday Kiran, P. Krishna Reddy
ICDM
2002
IEEE
153views Data Mining» more  ICDM 2002»
15 years 3 months ago
Generating an informative cover for association rules
Mining association rules may generate a large numbers of rules making the results hard to analyze manually. Pasquier et al. have discussed the generation of GuiguesDuquenne–Luxe...
Laurentiu Cristofor, Dan A. Simovici
KDD
2008
ACM
246views Data Mining» more  KDD 2008»
15 years 10 months ago
Direct mining of discriminative and essential frequent patterns via model-based search tree
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
Wei Fan, Kun Zhang, Hong Cheng, Jing Gao, Xifeng Y...
KDD
2002
ACM
157views Data Mining» more  KDD 2002»
15 years 10 months ago
Transforming data to satisfy privacy constraints
Data on individuals and entities are being collected widely. These data can contain information that explicitly identifies the individual (e.g., social security number). Data can ...
Vijay S. Iyengar