Sciweavers

311 search results - page 48 / 63
» Learning Polyhedral Classifiers Using Logistic Function
Sort
View
ICTIR
2009
Springer
13 years 6 months ago
Training Data Cleaning for Text Classification
Abstract. In text classification (TC) and other tasks involving supervised learning, labelled data may be scarce or expensive to obtain; strategies are thus needed for maximizing t...
Andrea Esuli, Fabrizio Sebastiani
AIPS
2008
13 years 11 months ago
Learning Relational Decision Trees for Guiding Heuristic Planning
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
Tomás de la Rosa, Sergio Jiménez, Da...
PAKDD
2001
ACM
136views Data Mining» more  PAKDD 2001»
14 years 1 months ago
Determining Progression in Glaucoma Using Visual Fields
Abstract. The standardized visual field assessment, which measures visual function in 76 locations of the central visual area, is an important diagnostic tool in the treatment of ...
Andrew Turpin, Eibe Frank, Mark Hall, Ian H. Witte...
IJCNN
2000
IEEE
14 years 8 days ago
Unsupervised Classification of Complex Clusters in Networks of Spiking Neurons
For unsupervised clustering in a network of spiking neurons we develop a temporal encoding of continuously valued data to obtain arbitrary clustering capacity and precision with a...
Sander M. Bohte, Johannes A. La Poutré, Joo...
BMCBI
2007
141views more  BMCBI 2007»
13 years 8 months ago
Using structural motif descriptors for sequence-based binding site prediction
Background: Many protein sequences are still poorly annotated. Functional characterization of a protein is often improved by the identification of its interaction partners. Here, ...
Andreas Henschel, Christof Winter, Wan Kyu Kim, Mi...