Sciweavers

161 search results - page 32 / 33
» An Application of Boosting to Graph Classification
Sort
View
CIKM
2010
Springer
13 years 3 months ago
Regularization and feature selection for networked features
In the standard formalization of supervised learning problems, a datum is represented as a vector of features without prior knowledge about relationships among features. However, ...
Hongliang Fei, Brian Quanz, Jun Huan
ICFP
2008
ACM
14 years 5 months ago
Write it recursively: a generic framework for optimal path queries
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
Akimasa Morihata, Kiminori Matsuzaki, Masato Takei...
CIVR
2008
Springer
125views Image Analysis» more  CIVR 2008»
13 years 7 months ago
Leveraging user query log: toward improving image data clustering
Image clustering is useful in many retrieval and classification applications. The main goal of image clustering is to partition a given dataset into salient clusters such that the...
Hao Cheng, Kien A. Hua, Khanh Vu
BMCBI
2008
175views more  BMCBI 2008»
13 years 5 months ago
Synonym set extraction from the biomedical literature by lexical pattern discovery
Background: Although there are a large number of thesauri for the biomedical domain many of them lack coverage in terms and their variant forms. Automatic thesaurus construction b...
John McCrae, Nigel Collier
CC
2008
Springer
133views System Software» more  CC 2008»
13 years 5 months ago
Hardness Amplification via Space-Efficient Direct Products
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
Venkatesan Guruswami, Valentine Kabanets