Sciweavers

3241 search results - page 79 / 649
» Challenges for Dataset Search
Sort
View
KDD
1995
ACM
133views Data Mining» more  KDD 1995»
15 years 2 months ago
Feature Subset Selection Using the Wrapper Method: Overfitting and Dynamic Search Space Topology
In the wrapperapproachto feature subset selection, a searchfor an optimalset of features is madeusingthe induction algorithm as a black box. Theestimated future performanceof the ...
Ron Kohavi, Dan Sommerfield
PAMI
2011
14 years 6 months ago
Product Quantization for Nearest Neighbor Search
— This paper introduces a product quantization based approach for approximate nearest neighbor search. The idea is to decomposes the space into a Cartesian product of low dimensi...
Hervé Jégou, Matthijs Douze, Cordeli...
AMT
2009
Springer
116views Multimedia» more  AMT 2009»
15 years 5 months ago
Unifying Web-Scale Search and Reasoning from the Viewpoint of Granularity
Considering the time constraints and Web scale data, it is impossible to achieve absolutely complete reasoning results. Plus, the same results may not meet the diversity of user ne...
Yi Zeng, Yan Wang, Zhisheng Huang, Ning Zhong
DILS
2009
Springer
15 years 5 months ago
Exploiting Parallelism to Accelerate Keyword Search on Deep-Web Sources
Increasingly, biological data is being shared over the deep web. Many biological queries can only be answered by successively searching a number of distinct web-sites. This paper i...
Tantan Liu, Fan Wang, Gagan Agrawal
IJCNN
2008
IEEE
15 years 5 months ago
Using Variable Neighborhood Search to improve the Support Vector Machine performance in embedded automotive applications
— In this work we show that a metaheuristic, the Variable Neighborhood Search (VNS), can be effectively used in order to improve the performance of the hardware–friendly versio...
Enrique Alba, Davide Anguita, Alessandro Ghio, San...