Sciweavers

410 search results - page 57 / 82
» MILIS: Multiple Instance Learning with Instance Selection
Sort
View
PKDD
2010
Springer
158views Data Mining» more  PKDD 2010»
15 years 1 months ago
Learning Sparse Gaussian Markov Networks Using a Greedy Coordinate Ascent Approach
In this paper, we introduce a simple but efficient greedy algorithm, called SINCO, for the Sparse INverse COvariance selection problem, which is equivalent to learning a sparse Ga...
Katya Scheinberg, Irina Rish
BMCBI
2010
183views more  BMCBI 2010»
15 years 3 months ago
Active learning for human protein-protein interaction prediction
Background: Biological processes in cells are carried out by means of protein-protein interactions. Determining whether a pair of proteins interacts by wet-lab experiments is reso...
Thahir P. Mohamed, Jaime G. Carbonell, Madhavi Gan...
ICDM
2009
IEEE
199views Data Mining» more  ICDM 2009»
15 years 10 months ago
Active Learning with Adaptive Heterogeneous Ensembles
—One common approach to active learning is to iteratively train a single classifier by choosing data points based on its uncertainty, but it is nontrivial to design uncertainty ...
Zhenyu Lu, Xindong Wu, Josh Bongard
EMNLP
2011
14 years 3 months ago
Relation Extraction with Relation Topics
This paper describes a novel approach to the semantic relation detection problem. Instead of relying only on the training instances for a new relation, we leverage the knowledge l...
Chang Wang, James Fan, Aditya Kalyanpur, David Gon...
COLT
2005
Springer
15 years 8 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon