484 search results - page 79 / 97 » Measuring the Quality of Approximated Clusterings |
111
click to vote
EWCBR
2004
Springer
15 years 7 months ago
2004
Springer
Over the years, many successful applications of case-based reasoning (CBR) systems have been developed in different areas. The performance of CBR systems depends on several factor...
117
Voted
ICML
1994
IEEE
15 years 5 months ago
1994
IEEE
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
123
Voted
ESANN
2004
15 years 3 months ago
2004
Abstract. Many real world problems are given in the form of multiple measurements comprising local descriptions or tasks. We propose that a dynamical organization of a population o...
233
click to vote
ICDE
2008
IEEE
16 years 3 months ago
2008
IEEE
Preserving individual privacy when publishing data is a problem that is receiving increasing attention. According to the k-anonymity principle, each release of data must be such th...
132
click to vote
MOBIHOC
2001
ACM
16 years 1 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...