4886 search results - page 463 / 978 » Approximate Data Exchange |
190
click to vote
ALT
2008
Springer
16 years 3 months ago
2008
Springer
We propose a new boosting algorithm for bipartite ranking problems. Our boosting algorithm, called SoftRankBoost, is a modification of RankBoost which maintains only smooth distri...
177
click to vote
ISAAC
2007
Springer
16 years 29 days ago
2007
Springer
Trajectory data is becoming increasingly available and the size of the trajectories is getting larger. In this paper we study the problem of compressing spatio-temporal trajectorie...
190
click to vote
ICDE
2006
IEEE
16 years 26 days ago
2006
IEEE
Widespread interest in time-series similarity search has made more in need of efficient technique, which can reduce dimensionality of the data and then to index it easily using a ...
168
click to vote
ICDM
2005
IEEE
16 years 13 days ago
2005
IEEE
In constraint-based mining, the monotone and antimonotone properties are exploited to reduce the search space. Even if a constraint has not such suitable properties, existing algo...
208
click to vote
WIRN
2005
Springer
16 years 9 days ago
2005
Springer
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...