Sciweavers

1601 search results - page 209 / 321
» Closed Sets for Labeled Data
Sort
View
MLDM
2005
Springer
15 years 12 months ago
Supervised Evaluation of Dataset Partitions: Advantages and Practice
In the context of large databases, data preparation takes a greater importance : instances and explanatory attributes have to be carefully selected. In supervised learning, instanc...
Sylvain Ferrandiz, Marc Boullé
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
13 years 8 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
KDD
2008
ACM
150views Data Mining» more  KDD 2008»
16 years 6 months ago
Hypergraph spectral learning for multi-label classification
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
Liang Sun, Shuiwang Ji, Jieping Ye
ICIP
2010
IEEE
15 years 4 months ago
Building Emerging Pattern (EP) Random forest for recognition
The Random forest classifier comes to be the working horse for visual recognition community. It predicts the class label of an input data by aggregating the votes of multiple tree...
Liang Wang, Yizhou Wang, Debin Zhao
BMCBI
2008
114views more  BMCBI 2008»
15 years 6 months ago
Visualizing and clustering high throughput sub-cellular localization imaging
Background: The expansion of automatic imaging technologies has created a need to be able to efficiently compare and review large sets of image data. To enable comparisons of imag...
Nicholas A. Hamilton, Rohan D. Teasdale