960 search results - page 41 / 192 » CURE: An Efficient Clustering Algorithm for Large Databases |
219
click to vote
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
Abstract-- Large graph datasets are common in many emerging database applications, and most notably in large-scale scientific applications. To fully exploit the wealth of informati...
126
Voted
WWW
2008
ACM
16 years 4 months ago
2008
ACM
Efficiently finding Web services on the Web is a challenging issue in service-oriented computing. Currently, UDDI is a standard for publishing and discovery of Web services, and U...
134
Voted
ICDM
2009
IEEE
15 years 1 months ago
2009
IEEE
The k-anonymization method is a commonly used privacy-preserving technique. Previous studies used various measures of utility that aim at enhancing the correlation between the orig...
142
Voted
PKDD
2010
Springer
15 years 1 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
228
click to vote
ICDE
2000
IEEE
16 years 5 months ago
2000
IEEE
Data mining algorithms have been the focus of much research recently. In practice, the input data to a data mining process resides in a large data warehouse whose data is kept up-...