Sciweavers

1165 search results - page 174 / 233
» Ontology-Enhanced Association Mining
Sort
View
KDD
1999
ACM
217views Data Mining» more  KDD 1999»
14 years 1 months ago
An Efficient Algorithm to Update Large Itemsets with Early Pruning
We present an efficient algorithm (UWEP) for updating large itemsets when new transactions are added to the set of old transactions. UWEP employs a dynamic lookahead strategy in u...
Necip Fazil Ayan, Abdullah Uz Tansel, M. Erol Arku...
GFKL
2007
Springer
137views Data Mining» more  GFKL 2007»
14 years 21 days ago
Families of Dendrograms
A conceptual framework for cluster analysis from the viewpoint of p-adic geometry is introduced by describing the space of all dendrograms for n datapoints and relating it to the m...
Patrick Erik Bradley
KDD
1995
ACM
133views Data Mining» more  KDD 1995»
14 years 11 days ago
Feature Subset Selection Using the Wrapper Method: Overfitting and Dynamic Search Space Topology
In the wrapperapproachto feature subset selection, a searchfor an optimalset of features is madeusingthe induction algorithm as a black box. Theestimated future performanceof the ...
Ron Kohavi, Dan Sommerfield
DIS
2008
Springer
13 years 10 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...
SDM
2010
SIAM
153views Data Mining» more  SDM 2010»
13 years 10 months ago
Reconstruction from Randomized Graph via Low Rank Approximation
The privacy concerns associated with data analysis over social networks have spurred recent research on privacypreserving social network analysis, particularly on privacypreservin...
Leting Wu, Xiaowei Ying, Xintao Wu