Sciweavers

303 search results - page 4 / 61
» Closed Set Mining of Biological Data
Sort
View
EDBT
2011
ACM
199views Database» more  EDBT 2011»
12 years 11 months ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...
KDD
2006
ACM
160views Data Mining» more  KDD 2006»
14 years 8 months ago
Coherent closed quasi-clique discovery from large dense graph databases
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...
Zhiping Zeng, Jianyong Wang, Lizhu Zhou, George Ka...
KDID
2004
140views Database» more  KDID 2004»
13 years 9 months ago
Mining Formal Concepts with a Bounded Number of Exceptions from Transactional Data
We are designing new data mining techniques on boolean contexts to identify a priori interesting bi-sets (i.e., sets of objects or transactions associated to sets of attributes or ...
Jérémy Besson, Céline Robarde...
IDEAL
2003
Springer
14 years 26 days ago
Association Rule Mining Algorithms for Set-Valued Data
This paper presents an association rule mining system that is capable of handling set-valued attributes. Our previous research has exposed us to a variety of real-world biological ...
Christopher A. Shoemaker, Carolina Ruiz
IPPS
2008
IEEE
14 years 2 months ago
Parallel mining of closed quasi-cliques
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
Yuzhou Zhang, Jianyong Wang, Zhiping Zeng, Lizhu Z...