Sciweavers

976 search results - page 120 / 196
» Evaluating Adversarial Partitions
Sort
View
RIAO
2004
13 years 10 months ago
Unsupervised Learning with Term Clustering for Thematic Segmentation of Texts
In this paper we introduce a machine learning approach for automatic text segmentation. Our text segmenter clusters text-segments containing similar concepts. It first discovers th...
Marc Caillet, Jean-François Pessiot, Massih...
IJCAI
1993
13 years 10 months ago
Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning
Since most real-world applications of classification learning involve continuous-valued attributes, properly addressing the discretization process is an important problem. This pa...
Usama M. Fayyad, Keki B. Irani
GECCO
2008
Springer
123views Optimization» more  GECCO 2008»
13 years 10 months ago
Hierarchical evolution of linear regressors
We propose an algorithm for function approximation that evolves a set of hierarchical piece-wise linear regressors. The algorithm, named HIRE-Lin, follows the iterative rule learn...
Francesc Teixidó-Navarro, Albert Orriols-Pu...
CORR
2010
Springer
146views Education» more  CORR 2010»
13 years 9 months ago
GRASP for the Coalition Structure Formation Problem
Abstract. The coalition structure formation problem represents an active research area in multi-agent systems. A coalition structure is defined as a partition of the agents involve...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...
EOR
2010
133views more  EOR 2010»
13 years 8 months ago
A memetic algorithm for graph coloring
Given an undirected graph G = (V, E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and th...
Zhipeng Lü, Jin-Kao Hao