396 search results - page 25 / 80 » Lossy Reduction for Very High Dimensional Data |
170
click to vote
MDM
2004
Springer
15 years 11 months ago
2004
Springer
Data broadcasting is well known for its excellent scalability. Multi-dimensional range queries, such as spatial range queries of geographical information for location dependent se...
211
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
126
click to vote
ICANN
2005
Springer
15 years 11 months ago
2005
Springer
Multidimensional Scaling (MDS) is a powerful dimension reduction technique for embedding high-dimensional data into a lowdimensional target space. Thereby, the distance relationshi...
175
click to vote
AUSDM
2007
Springer
16 years 6 days ago
2007
Springer
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
168
click to vote
MICAI
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...