Sciweavers

59 search results - page 9 / 12
» Mining for Mutually Exclusive Items in Transaction Databases
Sort
View
ACMSE
2010
ACM
13 years 5 months ago
Mining relaxed closed subspace clusters
This paper defines and discusses a new problem in the area of subspace clustering. It defines the problem of mining closed subspace clusters. This new concept allows for the culli...
Erich Allen Peterson, Peiyi Tang
APPINF
2003
13 years 8 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
KDD
2004
ACM
134views Data Mining» more  KDD 2004»
14 years 7 months ago
Exploiting a support-based upper bound of Pearson's correlation coefficient for efficiently identifying strongly correlated pair
Given a user-specified minimum correlation threshold and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with...
Hui Xiong, Shashi Shekhar, Pang-Ning Tan, Vipin Ku...
PODS
2003
ACM
156views Database» more  PODS 2003»
14 years 7 months ago
Limiting privacy breaches in privacy preserving data mining
There has been increasing interest in the problem of building accurate data mining models over aggregate data, while protecting privacy at the level of individual records. One app...
Alexandre V. Evfimievski, Johannes Gehrke, Ramakri...
IEAAIE
2009
Springer
14 years 2 months ago
Incremental Mining of Ontological Association Rules in Evolving Environments
The process of knowledge discovery from databases is a knowledge intensive, highly user-oriented practice, thus has recently heralded the development of ontology-incorporated data ...
Ming-Cheng Tseng, Wen-Yang Lin