4850 search results - page 703 / 970 » Approximate Data Structures with Applications |
154
click to vote
KDD
2004
ACM
16 years 5 months ago
2004
ACM
In order to effectively use machine learning algorithms, e.g., neural networks, for the analysis of survival data, the correct treatment of censored data is crucial. The concordan...
169
click to vote
ICA
2010
Springer
15 years 6 months ago
2010
Springer
We study a sparse coding learning algorithm that allows for a simultaneous learning of the data sparseness and the basis functions. The algorithm is derived based on a generative m...
141
click to vote
DATAMINE
2006
15 years 5 months ago
2006
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...
160
click to vote
KDD
2008
ACM
16 years 5 months ago
2008
ACM
Information diffusion, viral marketing, and collective classification all attempt to model and exploit the relationships in a network to make inferences about the labels of nodes....
176
click to vote
IROS
2006
IEEE
15 years 11 months ago
2006
IEEE
— We propose to classify the behaviors of a mobile robot thanks to topological methods as an alternative to metric ones. To do so, we adapt an analysis scheme from Physics of non...