Sciweavers

310 search results - page 40 / 62
» Communication Efficient Distributed Mining of Association Ru...
Sort
View
97
Voted
ACSC
2008
IEEE
15 years 3 months ago
An efficient hash-based algorithm for minimal k-anonymity
A number of organizations publish microdata for purposes such as public health and demographic research. Although attributes of microdata that clearly identify individuals, such a...
Xiaoxun Sun, Min Li, Hua Wang, Ashley W. Plank
DIS
2008
Springer
15 years 3 months ago
Constructing Iceberg Lattices from Frequent Closures Using Generators
Frequent closures (FCIs) and generators (FGs) as well as the precedence relation on FCIs are key components in the definition of a variety of association rule bases. Although their...
Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, R...
IJAIT
2007
180views more  IJAIT 2007»
15 years 1 months ago
Detection and Prediction of Rare Events in Transaction Databases
Rare events analysis is an area that includes methods for the detection and prediction of events, e.g. a network intrusion or an engine failure, that occur infrequently and have s...
Christos Berberidis, Ioannis P. Vlahavas
107
Voted
KES
2004
Springer
15 years 7 months ago
FIT: A Fast Algorithm for Discovering Frequent Itemsets in Large Databases
Association rule mining is an important data mining problem that has been studied extensively. In this paper, a simple but Fast algorithm for Intersecting attribute lists using a ...
Jun Luo, Sanguthevar Rajasekaran
107
Voted
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
14 years 11 months ago
Efficient and Numerically Stable Sparse Learning
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
Sihong Xie, Wei Fan, Olivier Verscheure, Jiangtao ...