P. Andritsos, P. Tsaparas, R. J. Miller, and K. C. Sevcik. Limbo: Scalable Clustering of Categorical Data. Hellenic Database Symposium, 2003. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On Schema Discovery - Miller, Andritsos (2003) Self-citation (Andritsos Miller) (Correct)
No context found.
P. Andritsos, P. Tsaparas, R. J. Miller, and K. C. Sevcik. Limbo: Scalable Clustering of Categorical Data. Hellenic Database Symposium, 2003.
Link Analysis Ranking Algorithms Theory And Experiments - Borodin, Roberts.. (2004) Self-citation (Tsaparas) (Correct)
....is the plot of the vector of hub nodes that point to the correspnding authority node. In order to reveal some of the structure of the graph, the rows and columns are permuted so that similar nodes are brought together. For this, we used LIMBO, an agglomerative hierarchical clustering algorithm [2], which is based on the Information Bottleneck method [50, 47] The distance between two vectors is measured by normalizing the vectors so that the sum of their 30 query nodes hubs authorities links med out avg out ACC size users abortion 3340 2299 1666 22287 3 9.69 1583 22 affirmative action ....
P. Andritsos, P. Tsaparas, R. Miller, and K. Sevcik. LIMBO: Scalable clustering of categorical data, 2003. Submitted for publication.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC