Sciweavers

16 search results - page 2 / 4
» Efficient Discovery of Frequent Correlated Subgraph Pairs
Sort
View
SIGMOD
2004
ACM
184views Database» more  SIGMOD 2004»
15 years 9 months ago
CORDS: Automatic Discovery of Correlations and Soft Functional Dependencies
The rich dependency structure found in the columns of real-world relational databases can be exploited to great advantage, but can also cause query optimizers--which usually assum...
Ihab F. Ilyas, Volker Markl, Peter J. Haas, Paul B...
KDD
2006
ACM
160views Data Mining» more  KDD 2006»
15 years 9 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...
DMIN
2006
126views Data Mining» more  DMIN 2006»
14 years 10 months ago
An Algorithm for the Discovery of Arbitrary Length Ordinal Association Rules
Association rule mining techniques are used to search attribute-value pairs that occur frequently together in a data set. Ordinal association rules are a particular type of associa...
Alina Campan, Gabriela Serban, Traian Marius Truta...
BMCBI
2008
141views more  BMCBI 2008»
14 years 9 months ago
Discovering functional interaction patterns in protein-protein interaction networks
Background: In recent years, a considerable amount of research effort has been directed to the analysis of biological networks with the availability of genome-scale networks of ge...
Mehmet E. Turanalp, Tolga Can
JCC
2011
109views more  JCC 2011»
14 years 9 days ago
VoteDock: Consensus docking method for prediction of protein-ligand interactions
: Molecular recognition plays a fundamental role in all biological processes, and that is why great efforts have been made to understand and predict protein–ligand interactions. ...
Dariusz Plewczynski, Michal Lazniewski, Marcin von...