Sciweavers

1025 search results - page 132 / 205
» Constraint Programming for Data Mining and Machine Learning
Sort
View
ML
2007
ACM
101views Machine Learning» more  ML 2007»
15 years 2 months ago
A persistent union-find data structure
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
Sylvain Conchon, Jean-Christophe Filliâtre
LREC
2010
144views Education» more  LREC 2010»
15 years 4 months ago
Inferring Syntactic Rules for Word Alignment through Inductive Logic Programming
This paper presents and evaluates an original approach to automatically align bitexts at the word level. It relies on a syntactic dependency analysis of the source and target text...
Sylwia Ozdowska, Vincent Claveau
KDD
2005
ACM
163views Data Mining» more  KDD 2005»
16 years 3 months ago
Data Sparsity Issues in the Collaborative Filtering Framework
Abstract. With the amount of available information on the Web growing rapidly with each day, the need to automatically filter the information in order to ensure greater user effici...
Miha Grcar, Dunja Mladenic, Blaz Fortuna, Marko Gr...
CORR
2006
Springer
153views Education» more  CORR 2006»
15 years 3 months ago
Genetic Programming, Validation Sets, and Parsimony Pressure
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
Christian Gagné, Marc Schoenauer, Marc Pari...
HEURISTICS
2008
92views more  HEURISTICS 2008»
15 years 3 months ago
Learning heuristics for basic block instruction scheduling
Instruction scheduling is an important step for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction scheduling is to ...
Abid M. Malik, Tyrel Russell, Michael Chase, Peter...