Sciweavers

86 search results - page 1 / 18
» Efficient Vertical Mining of Frequent Closures and Generator...
Sort
View
IDA
2009
Springer
13 years 2 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...
DIS
2008
Springer
13 years 6 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...
APWEB
2005
Springer
13 years 10 months ago
A Fast Algorithm for Mining Share-Frequent Itemsets
Itemset share has been proposed as a measure of the importance of itemsets for mining association rules. The value of the itemset share can provide useful information such as total...
Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang
JCIT
2008
128views more  JCIT 2008»
13 years 4 months ago
OPAM-An Efficient One Pass Association Mining Technique without Candidate Generation
This paper presents an efficient One Pass Association Mining technique i.e. OPAM, which finds all the frequent itemsets without generating any candidate sets. OPAM is basically an...
S. Roy, D. K. Bhattacharyya
IJKDB
2010
141views more  IJKDB 2010»
13 years 2 months ago
Mining Frequent Boolean Expressions: Application to Gene Expression and Regulatory Modeling
Regulatory network analysis and other bioinformatics tasks require the ability to induce and represent arbitrary boolean expressions from data sources. We introduce a novel framew...
Mohammed Javeed Zaki, Naren Ramakrishnan, Lizhuang...