Sciweavers

1268 search results - page 125 / 254
» Finding a curve in a map
Sort
View
ICML
2008
IEEE
16 years 7 months ago
Bayesian probabilistic matrix factorization using Markov chain Monte Carlo
Low-rank matrix approximation methods provide one of the simplest and most effective approaches to collaborative filtering. Such models are usually fitted to data by finding a MAP...
Ruslan Salakhutdinov, Andriy Mnih
KDD
2007
ACM
178views Data Mining» more  KDD 2007»
16 years 6 months ago
Density-based clustering for real-time stream data
Existing data-stream clustering algorithms such as CluStream are based on k-means. These clustering algorithms are incompetent to find clusters of arbitrary shapes and cannot hand...
Yixin Chen, Li Tu
MUE
2008
IEEE
137views Multimedia» more  MUE 2008»
16 years 22 days ago
Genetic Algorithm for Shortest Driving Time in Intelligent Transportation Systems
The route guidance system, which provides driving advice based on traffic information about an origin and a destination, has become very popular along with the advancement of hand...
Chu-Hsing Lin, Jui-Ling Yu, Jung-Chun Liu, Chia-Je...
FSKD
2005
Springer
162views Fuzzy Logic» more  FSKD 2005»
15 years 12 months ago
Fuzzy-C-Mean Determines the Principle Component Pairs to Estimate the Degree of Emotion from Facial Expressions
Although many systems exist for automatic classification of faces according to their emotional expression, these systems do not explicitly estimate the strength of given expression...
M. Ashraful Amin, Nitin V. Afzulpurkar, Matthew N....
ICML
1994
IEEE
15 years 10 months ago
A Conservation Law for Generalization Performance
Conservation of information (COI) popularized by the no free lunch theorem is a great leveler of search algorithms, showing that on average no search outperforms any other. Yet in ...
Cullen Schaffer