Sciweavers

28 search results - page 5 / 6
» A Fast Algorithm for Mining Share-Frequent Itemsets
Sort
View
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
14 years 6 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
CLUSTER
2008
IEEE
13 years 7 months ago
Variable-grain and dynamic work generation for Minimal Unique Itemset mining
Abstract--SUDA2 is a recursive search algorithm for Minimal Unique Itemset detection. Such sets of items are formed via combinations of non-obvious attributes enabling individual r...
Paraskevas Yiapanis, David J. Haglin, Anna M. Mann...
KDD
2003
ACM
156views Data Mining» more  KDD 2003»
14 years 6 months ago
Fast vertical mining using diffsets
A number of vertical mining algorithms have been proposed recently for association mining, which have shown to be very effective and usually outperform horizontal approaches. The ...
Mohammed Javeed Zaki, Karam Gouda
ICA3PP
2005
Springer
13 years 11 months ago
Mining Traces of Large Scale Systems
Abstract— Large scale distributed computing infrastructure captures the use of high number of nodes, poor communication performance and continously varying resources that are not...
Christophe Cérin, Michel Koskas
KDD
2004
ACM
157views Data Mining» more  KDD 2004»
13 years 11 months ago
Fast mining of spatial collocations
Spatial collocation patterns associate the co-existence of nonspatial features in a spatial neighborhood. An example of such a pattern can associate contaminated water reservoirs ...
Xin Zhang, Nikos Mamoulis, David W. Cheung, Yutao ...