5962 search results - page 207 / 1193 » Efficient Clustering for Orders |
165
click to vote
AAAI
1997
15 years 8 months ago
1997
This paper describes an environment for supporting very large ontologies. The system can be used on single PCs, workstations, a cluster of workstations, and high-end parallel supe...
198
click to vote
IS
2008
15 years 6 months ago
2008
We propose a dimensionality reduction technique for time series analysis that significantly improves the efficiency and accuracy of similarity searches. In contrast to piecewise c...
186
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
164
click to vote
SDM
2004
SIAM
15 years 8 months ago
2004
SIAM
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...
208
click to vote
SDM
2003
SIAM
15 years 8 months ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...