Sciweavers

5138 search results - page 83 / 1028
» Low-Entropy Set Selection.
Sort
View
IMCSIT
2010
15 years 4 months ago
Learning taxonomic relations from a set of text documents
This paper presents a methodology for learning taxonomic relations from a set of documents that each explain one of the concepts. Three different feature extraction approaches with...
Mari-Sanna Paukkeri, Alberto Pérez Garc&iac...
EDBT
2009
ACM
175views Database» more  EDBT 2009»
16 years 1 months ago
Towards materialized view selection for distributed databases
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
Leonardo Weiss Ferreira Chaves, Erik Buchmann, Fab...
KSEM
2009
Springer
16 years 25 days ago
A Competitive Learning Approach to Instance Selection for Support Vector Machines
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
Mario Zechner, Michael Granitzer
IJAMCIGI
2010
90views more  IJAMCIGI 2010»
15 years 3 months ago
A Reinforcement Learning - Great-Deluge Hyper-Heuristic for Examination Timetabling
Hyper-heuristics are identified as the methodologies that search the space generated by a finite set of low level heuristics for solving difficult problems. One of the iterative h...
Ender Özcan, Mustafa Misir, Gabriela Ochoa, E...
PREMI
2011
Springer
14 years 9 months ago
Finding Potential Seeds through Rank Aggregation of Web Searches
This paper presents a potential seed selection algorithm for web crawlers using a gain - share scoring approach. Initially we consider a set of arbitrarily chosen tourism queries. ...
Rajendra Prasath, Pinar Öztürk