| E.L. Johnson and H. Kargupta. Collective, hierarchical clustering from distributed heterogeneous data. In Zaki and Ho [73], pages 221--244. |
....5.3 shows the dendrogram obtained using hierarchical agglomerative clustering for the iris data set. One can see that again the clusters obtained are almost identical with the classes of the iris. In the case of a database which was distributed over p processors an algorithm is presented in [46] for single link clustering which has O(pN ) time and O(pN) space complexity. The communication costs of the algorithm are O(N ) The algorithm has the following three steps: Apply the hierarchical clustering algorithm at each site. Transmit the local dendrograms to the facilitator site. ....
E.L. Johnson and H. Kargupta. Collective, hierarchical clustering from distributed heterogeneous data. In Zaki and Ho [73], pages 221--244.
No context found.
E.L. Johnson and H. Kargupta. Collective, hierarchical clustering from distributed heterogeneous data. In Zaki and Ho [73], pages 221--244.
No context found.
Johnson, E., Kargupta, H.: Collective, hierarchical clustering from distributed heterogeneous data. In Zaki, M., Ho, C., eds.: Large-Scale Parallel KDD Systems. Lecture Notes in Computer Science. Springer-Verlag (1999) 221--244
No context found.
Erik Johnson and Hillol Kargupta. Collective, hierarchical clustering from distributed heterogeneous data. In M. Zaki and C. Ho, editors, LargeScale Parallel KDD Systems, Lecture Notes in Computer Science, pages 221--244. Springer-Verlag, 1999.
No context found.
E. JOHNSON AND H. KARGUPTA, Collective, Hierarchical Clustering from Distributed Heterogeneous Data, Lecture Notes in Computer Science 1759, Springer Verlag, 2000.
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