Sciweavers

138 search results - page 20 / 28
» Algorithms for induced biclique optimization problems
Sort
View
KDD
2010
ACM
245views Data Mining» more  KDD 2010»
13 years 10 months ago
Learning incoherent sparse and low-rank patterns from multiple tasks
We consider the problem of learning incoherent sparse and lowrank patterns from multiple tasks. Our approach is based on a linear multi-task learning formulation, in which the spa...
Jianhui Chen, Ji Liu, Jieping Ye
AI
1999
Springer
13 years 8 months ago
Learning by Discovering Concept Hierarchies
We present a new machine learning method that, given a set of training examples, induces a definition of the target concept in terms of a hierarchy of intermediate concepts and th...
Blaz Zupan, Marko Bohanec, Janez Demsar, Ivan Brat...
RECOMB
2005
Springer
14 years 9 months ago
Pairwise Local Alignment of Protein Interaction Networks Guided by Models of Evolution
Abstract. With ever increasing amount of available data on protein-protein interaction (PPI) networks and research revealing that these networks evolve at a modular level, discover...
Mehmet Koyutürk, Ananth Grama, Wojciech Szpan...
CVPR
2010
IEEE
13 years 8 months ago
Learning kernels for variants of normalized cuts: Convex relaxations and applications
We propose a new algorithm for learning kernels for variants of the Normalized Cuts (NCuts) objective – i.e., given a set of training examples with known partitions, how should ...
Lopamudra Mukherjee, Vikas Singh, Jiming Peng, Chr...
ICALP
2005
Springer
14 years 2 months ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos