Sciweavers

197 search results - page 17 / 40
» Improved Approximation Algorithms for Bipartite Correlation ...
Sort
View
CINQ
2004
Springer
133views Database» more  CINQ 2004»
13 years 11 months ago
Inductive Querying for Discovering Subgroups and Clusters
We introduce the problem of cluster-grouping and show that it integrates several important data mining tasks, i.e. subgroup discovery, mining correlated patterns and aspects from c...
Albrecht Zimmermann, Luc De Raedt
CIKM
2010
Springer
13 years 6 months ago
Multi-view clustering with constraint propagation for learning with an incomplete mapping between views
Multi-view learning algorithms typically assume a complete bipartite mapping between the different views in order to exchange information during the learning process. However, ma...
Eric Eaton, Marie desJardins, Sara Jacob
BMCBI
2007
173views more  BMCBI 2007»
13 years 7 months ago
Recursive Cluster Elimination (RCE) for classification and feature selection from gene expression data
Background: Classification studies using gene expression datasets are usually based on small numbers of samples and tens of thousands of genes. The selection of those genes that a...
Malik Yousef, Segun Jung, Louise C. Showe, Michael...
AI
2010
Springer
13 years 7 months ago
Understanding the scalability of Bayesian network inference using clique tree growth curves
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
Ole J. Mengshoel
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
13 years 7 months ago
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Nie...