Sciweavers

658 search results - page 6 / 132
» Arguing from Experience to Classifying Noisy Data
Sort
View
DATAMINE
2002
169views more  DATAMINE 2002»
13 years 7 months ago
Advances in Instance Selection for Instance-Based Learning Algorithms
The basic nearest neighbour classifier suffers from the indiscriminate storage of all presented training instances. With a large database of instances classification response time ...
Henry Brighton, Chris Mellish
AAAI
2007
13 years 9 months ago
The Impact of Time on the Accuracy of Sentiment Classifiers Created from a Web Log Corpus
We investigate the impact of time on the predictability of sentiment classification research for models created from web logs. We show that sentiment classifiers are time dependen...
Kathleen T. Durant, Michael D. Smith
GRC
2008
IEEE
13 years 8 months ago
Neighborhood Smoothing Embedding for Noisy Manifold Learning
Manifold learning can discover the structure of high dimensional data and provides understanding of multidimensional patterns by preserving the local geometric characteristics. Ho...
Guisheng Chen, Junsong Yin, Deyi Li
IJON
2006
85views more  IJON 2006»
13 years 7 months ago
From outliers to prototypes: Ordering data
We propose simple and fast methods based on nearest neighbors that order objects from high-dimensional data sets from typical points to untypical points. On the one hand, we show ...
Stefan Harmeling, Guido Dornhege, David M. J. Tax,...
ISMB
1993
13 years 8 months ago
Knowledge-Based Generation of Machine-Learning Experiments: Learning with DNA Crystallography Data
Thoughit has been possible in the past to learn to predict DNAhydration patterns from crystallographic data, there is ambiguity in the choice of training data (both in terms of th...
Dawn M. Cohen, Casimir A. Kulikowski, Helen Berman