Sciweavers

118 search results - page 9 / 24
» Efficient mining of frequent sequence generators
Sort
View
77
Voted
FSKD
2005
Springer
90views Fuzzy Logic» more  FSKD 2005»
15 years 3 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
IJKDB
2010
141views more  IJKDB 2010»
14 years 7 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...
APWEB
2005
Springer
15 years 3 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
AICCSA
2008
IEEE
216views Hardware» more  AICCSA 2008»
14 years 9 months ago
Mining fault tolerant frequent patterns using pattern growth approach
Mining fault tolerant (FT) frequent patterns from transactional datasets are very complex than mining all frequent patterns (itemsets), in terms of both search space exploration a...
Shariq Bashir, Zahid Halim, Abdul Rauf Baig
PKDD
2010
Springer
235views Data Mining» more  PKDD 2010»
14 years 7 months ago
Online Structural Graph Clustering Using Frequent Subgraph Mining
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
Madeleine Seeland, Tobias Girschick, Fabian Buchwa...