4110 search results - page 452 / 822 » Efficient algorithms for the 2-gathering problem |
196
click to vote
PAKDD
2001
ACM
15 years 11 months ago
2001
ACM
Data clustering methods have many applications in the area of data mining. Traditional clustering algorithms deal with quantitative or categorical data points. However, there exist...
195
click to vote
KDD
2010
ACM
15 years 10 months ago
2010
ACM
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...
169
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...
168
click to vote
CN
2008
15 years 6 months ago
2008
In large peer-to-peer (P2P) overlay networks, nodes usually share resources to support all kinds of applications. In such networks, a subset of the nodes may assume the role of br...
196
click to vote
PE
2008
Springer
15 years 6 months ago
2008
Springer
Ratings (also known as recommendations) provide an efficient and effective way to build trust relationship in the human society, by making use of the information from others rathe...