Sciweavers

192 search results - page 16 / 39
» Efficient Mining of Dissociation Rules
Sort
View
DKE
2008
159views more  DKE 2008»
13 years 7 months ago
Isolated items discarding strategy for discovering high utility itemsets
Traditional methods of association rule mining consider the appearance of an item in a transaction, whether or not it is purchased, as a binary variable. However, customers may pu...
Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang
APPINF
2003
13 years 9 months ago
Fast Frequent Itemset Mining using Compressed Data Representation
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
Raj P. Gopalan, Yudho Giri Sucahyo
PAKDD
2001
ACM
121views Data Mining» more  PAKDD 2001»
14 years 1 days ago
Direct Domain Knowledge Inclusion in the PA3 Rule Induction Algorithm
Inclusion of domain knowledge in a process of knowledge discovery in databases is a complex but very important part of successful knowledge discovery solutions. In real-life data m...
Pedro de Almeida
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 7 months ago
Providing k-anonymity in data mining
In this paper we present extended definitions of k-anonymity and use them to prove that a given data mining model does not violate the k-anonymity of the individuals represented in...
Arik Friedman, Ran Wolff, Assaf Schuster
IDEAL
2003
Springer
14 years 24 days ago
Improving the Efficiency of Frequent Pattern Mining by Compact Data Structure Design
Mining frequent patterns has been a topic of active research because it is computationally the most expensive step in association rule discovery. In this paper, we discuss the use ...
Raj P. Gopalan, Yudho Giri Sucahyo