Sciweavers

1651 search results - page 144 / 331
» Measuring the Complexity of Classification Problems
Sort
View
HCI
2009
13 years 5 months ago
Can Neurophysiologic Synchronies Provide a Platform for Adapting Team Performance?
We have explored using neurophysiologic patterns as an approach for developing a deeper understanding of how teams collaborate when solving time-critical, complex real-world proble...
Ronald H. Stevens, Trysha Galloway, Chris Berka, M...
KDD
2001
ACM
192views Data Mining» more  KDD 2001»
14 years 8 months ago
Data mining with sparse grids using simplicial basis functions
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
Jochen Garcke, Michael Griebel
NIPS
2001
13 years 9 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio
BMCBI
2006
150views more  BMCBI 2006»
13 years 8 months ago
Instance-based concept learning from multiclass DNA microarray data
Background: Various statistical and machine learning methods have been successfully applied to the classification of DNA microarray data. Simple instance-based classifiers such as...
Daniel P. Berrar, Ian Bradbury, Werner Dubitzky
STACS
2009
Springer
14 years 2 months ago
Tractable Structures for Constraint Satisfaction with Truth Tables
The way the graph structure of the constraints influences the complexity of constraint satisfaction problems (CSP) is well understood for bounded-arity constraints. The situation...
Dániel Marx