Sciweavers

7228 search results - page 42 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
KDD
2008
ACM
137views Data Mining» more  KDD 2008»
15 years 10 months ago
Learning classifiers from only positive and unlabeled data
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
Charles Elkan, Keith Noto
AIME
1997
Springer
15 years 1 months ago
Detecting Very Early Stages of Dementia from Normal Aging with Machine Learning Methods
We used Machine Learning (ML) methods to learn the best decision rules to distinguish normal brain aging from the earliest stages of dementia using subsamples of 198 normal and 244...
William Rodman Shankle, Subramani Mani, Michael J....
MM
2010
ACM
125views Multimedia» more  MM 2010»
14 years 10 months ago
Tenor: making coding practical from servers to smartphones
It has been theoretically shown that performing coding in networked systems, including Reed-Solomon codes, fountain codes, and random network coding, has a clear advantage with re...
Hassan Shojania, Baochun Li
WWW
2008
ACM
15 years 10 months ago
Learning transportation mode from raw gps data for geographic applications on the web
Geographic information has spawned many novel Web applications where global positioning system (GPS) plays important roles in bridging the applications and end users. Learning kno...
Yu Zheng, Like Liu, Longhao Wang, Xing Xie
GECCO
2006
Springer
141views Optimization» more  GECCO 2006»
15 years 1 months ago
Towards effective adaptive random testing for higher-dimensional input domains
Adaptive Random Testing subsumes a class of algorithms that detect the first failure with less test cases than Random Testing. The present paper shows that a "reference metho...
Johannes Mayer