Sciweavers

45 search results - page 9 / 9
» fs 2006
Sort
View
DM
2006
82views more  DM 2006»
13 years 10 months ago
On the extension of vertex maps to graph homomorphisms
A reflexive graph is a simple undirected graph where a loop has been added at each vertex. If G and H are reflexive graphs and U V (H), then a vertex map f : U V (G) is called n...
Geir Agnarsson, Li Chen
ALGORITHMICA
2006
74views more  ALGORITHMICA 2006»
13 years 10 months ago
Parallelizing Feature Selection
Classification is a key problem in machine learning/data mining. Algorithms for classification have the ability to predict the class of a new instance after having been trained on...
Jerffeson Teixeira de Souza, Stan Matwin, Nathalie...
PRL
2010
159views more  PRL 2010»
13 years 8 months ago
Creating diverse nearest-neighbour ensembles using simultaneous metaheuristic feature selection
The nearest-neighbour (1NN) classifier has long been used in pattern recognition, exploratory data analysis, and data mining problems. A vital consideration in obtaining good res...
Muhammad Atif Tahir, Jim E. Smith
SYNTHESE
2008
74views more  SYNTHESE 2008»
13 years 10 months ago
Could there be exactly two things?
Many philosophers think that, necessarily, any material objects have a fusion (let's call that doctrine "Universalism"). In this paper I point out a couple of strang...
Juan Comesaña
MLQ
2000
99views more  MLQ 2000»
13 years 10 months ago
Von Rimscha's Transitivity Conditions
In Zermelo-Fraenkel set theory with the axiom of choice every set has the same cardinal number as some ordinal. Von Rimscha has weakened this condition to "Every set has the s...
Paul E. Howard, Jean E. Rubin, Adrienne Stanley