• A
  • A
  • A
  • АБB
  • АБB
  • АБB
  • А
  • А
  • А
  • А
  • А
Обычная версия сайта

Глава

From Triconcepts to Triclusters

P. 185-200.

A vast amount of documents in the Web have duplicates, which is a challenge for developing efficient methods that would compute clusters of similar documents. In this paper we use an approach based on computing (closed) sets of attributes having large support (large extent) as clusters of similar documents. The method is tested in a series of computer experiments on large public collections of web documents and compared to other established methods and software, such as biclustering, on same datasets. Practical efficiency of different algorithms for computing frequent closed sets of attributes is compared.

В книге

From Triconcepts to Triclusters
Под науч. редакцией: S. Rudolph, F. Dau, S. Kuznetsov. Vol. 5662. Berlin; Heidelberg: Springer, 2009.