Sciweavers

94 search results - page 6 / 19
» Efficient Frequent Itemsets Mining by Sampling
Sort
View
FSKD
2005
Springer
90views Fuzzy Logic» more  FSKD 2005»
15 years 2 months ago
Direct Candidates Generation: A Novel Algorithm for Discovering Complete Share-Frequent Itemsets
The value of the itemset share is one way of evaluating the magnitude of an itemset. From business perspective, itemset share values reflect more the significance of itemsets for m...
Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang
SIGCOMM
2010
ACM
14 years 9 months ago
Automating root-cause analysis of network anomalies using frequent itemset mining
Finding the root-cause of a network security anomaly is essential for network operators. In our recent work [1, 5], we introduced a generic technique that uses frequent itemset mi...
Ignasi Paredes-Oliva, Xenofontas A. Dimitropoulos,...
DAWAK
2010
Springer
14 years 10 months ago
Mining Closed Itemsets in Data Stream Using Formal Concept Analysis
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...
Anamika Gupta, Vasudha Bhatnagar, Naveen Kumar
IDA
2009
Springer
14 years 7 months ago
Efficient Vertical Mining of Frequent Closures and Generators
Abstract. The effective construction of many association rule bases requires the computation of both frequent closed and frequent generator itemsets (FCIs/FGs). However, only few m...
Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, R...
KAIS
2008
150views more  KAIS 2008»
14 years 9 months ago
A survey on algorithms for mining frequent itemsets over data streams
The increasing prominence of data streams arising in a wide range of advanced applications such as fraud detection and trend learning has led to the study of online mining of freq...
James Cheng, Yiping Ke, Wilfred Ng