Loading...

Attaining higher quality for density based algorithms

Haghir Chehreghani, M ; Sharif University of Technology | 2007

299 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-540-72982-2_27
  3. Publisher: Springer Verlag , 2007
  4. Abstract:
  5. So far several methods have been proposed for clustering the web. On the other hand, many algorithms have been developed for clustering the relational data, but their usage for the Web is to be investigated. One main category of such algorithms is density based methods providing high quality results. In this paper first, a new density based algorithm is introduced and then it is compared with other algorithms of this category. The proposed algorithm has some interesting properties and capabilities such as hierarchical clustering and sampling, making it suitable for clustering the web data. © Springer-Verlag Berlin Heidelberg 2007
  6. Keywords:
  7. Data reduction ; Hierarchical systems ; World Wide Web ; Density based algorithms ; Hierarchical clustering ; Relational data ; Clustering algorithms
  8. Source: 1st International Conference on Web Reasoning and Rule Systems, RR 2007, Innsbruck, 7 June 2007 through 8 June 2007 ; Volume 4524 LNCS , 2007 , Pages 329-338 ; 03029743 (ISSN); 354072981X (ISBN); 9783540729815 (ISBN)
  9. URL: https://link.springer.com/chapter/10.1007%2F978-3-540-72982-2_27