Sciweavers

Share
7 search results - page 1 / 2
» Sparse Substring Pattern Set Discovery Using Linear Programm...
Sort
View
DIS
2010
Springer
11 years 11 months ago
Sparse Substring Pattern Set Discovery Using Linear Programming Boosting
In this paper, we consider finding a small set of substring patterns which classifies the given documents well. We formulate the problem as 1 norm soft margin optimization problem ...
Kazuaki Kashihara, Kohei Hatano, Hideo Bannai, Mas...
RECOMB
2006
Springer
13 years 2 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
NIPS
2003
12 years 3 months ago
Multiple-Instance Learning via Disjunctive Programming Boosting
Learning from ambiguous training data is highly relevant in many applications. We present a new learning algorithm for classiļ¬cation problems where labels are associated with se...
Stuart Andrews, Thomas Hofmann
KDD
2006
ACM
170views Data Mining» more  KDD 2006»
13 years 2 months ago
Computer aided detection via asymmetric cascade of sparse hyperplane classifiers
This paper describes a novel classification method for computer aided detection (CAD) that identifies structures of interest from medical images. CAD problems are challenging larg...
Jinbo Bi, Senthil Periaswamy, Kazunori Okada, Tosh...
KDD
2004
ACM
181views Data Mining» more  KDD 2004»
13 years 2 months ago
Column-generation boosting methods for mixture of kernels
We devise a boosting approach to classification and regression based on column generation using a mixture of kernels. Traditional kernel methods construct models based on a single...
Jinbo Bi, Tong Zhang, Kristin P. Bennett
books