Merging distributed database summaries

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2007, Pages 419-428

  Bechchi, Mounir ^a   Raschia, Guillaume ^a   Mouaddib, Noureddine ^a  

^a INSTITUT DE RECHERCHE EN COMMUNICATIONS ET CYBERNÉTIQUE DE NANTES   (France)

Author keywords

Database summary; Distributed clustering; Tree alignment

Indexed keywords

ALIGNMENT ALGORITHMS; ALTERNATIVE APPROACHES; CENTRALIZED DATABASE; COMPUTATIONAL TIME; CONSTANT TIME COMPLEXITY; DATA SETS; DATABASE SUMMARIZATIONS; DATABASE SUMMARY; DISTRIBUTED CLUSTERING; DISTRIBUTED DATABASE; EXPERIMENTAL STUDIES; EXPONENTIAL TIME COMPLEXITY; GLOBAL PATTERNS; HIERARCHICAL CLUSTERING ALGORITHMS; HIERARCHICAL ORGANIZATIONS; MERGING ALGORITHMS; MERGING PROCESS; MULTI RESOLUTIONS; NUMBER OF DATUM; OPTIMAL PARTITIONING; OPTIMISATION; PRIVACY PRESERVING; QUALITY MEASURES; REAL DATA SETS; RESOURCE LIMITATIONS; STRUCTURED DATUM; TOP-DOWN MANNERS; TREE ALIGNMENT;

ALIGNMENT; CLUSTERING ALGORITHMS; COST FUNCTIONS; KNOWLEDGE MANAGEMENT; MERGERS AND ACQUISITIONS; MERGING;

TREES (MATHEMATICS);

EID: 63249119284     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1321440.1321500     Document Type: Conference Paper

References (27)

1. G. Raschia et al,"SAINTETlQ: a fuzzy set-based approach to database summarization," Fuzzy Sets Syst., 129(2):137-162, 2002.
2. R. Saint-Paul et al, "General purpose database summarization," VLDB '05: Proceedings of the 31st international conference on Very large data bases,733-744, 2005.
3. Halkidi et al, "clustering validation," Journal of Intelligent Information Systems,107-145, 2001.
4. L. A. Zadeh, "Information and Control," Fuzzy Sets, 8:338-353, 1956.
5. L. A. Zadeh, "Concept of a linguistic variable and its application to approximate reasoning," Information and Systems, 1:119-249, 1975.
6. L. A. Zadeh, "Fuzzy sets as a basis for a theory of possibility," Fuzzy Sets and Systems, 100:9-34, 1999.
7. X. Xu et al, "A Fast Parallel Clustering Algorithm for Large Spatial Databases," Data Min. Knowl. Discov., 3(3):263-290, 1999.
8. K. Thompson et al, "Concept Formation in Structured Domains," Concept formation: Knowledge and experience in unsupervised learning, 127-161, 1991.
9. E. Rosch et al, "Family ressemblances: studies in the internal structure of categories," Cognitive Psychology,7:573-605, 1975.
10. A. Tversky, "Features of similarity," Psycol. Rev., 84(4):327-352, 1977.
11. S. Inderjit Dhillon et al, "A Data-Clustering Algorithm on Distributed Memory Multiprocessors," Large-Scale Parallel Data Mining, Lecture Notes in Artificial Intelligence, 245-260, 2000.
12. J. Ghosh et al, "Distributed Clustering with Limited Knowledge Sharing," Proceedings of the 5th International Conference on Advances in Pattern Recognition (ICAPR), 48-53, 2003.
13. E. Januzaj et al, "Towards Effective and Efficient Distributed Clustering," Proc. Int. Workshop on Clustering Large Data Sets, 3rd IEEE International Conference on Data Mining (ICDM ), 49-58, 2003.
14. J. Ghosh et al, "A Consensus Framework for Integrating Distributed Clusterings Under Limited Knowledge Sharing," Proc. NSF Workshop on Next Generation Data Mining, 99-108, 2002.
15. M. Klusch et al, "Distributed clustering based on sampling local density estimates," Proc. IJCAI-03, Acapulco, Mexico. AAAI Press, 2003.
16. P. E. Jouve et al, "A New Method for Combining Partitions, Applications for Distributed Clustering," Proceedings of the International Workshop on Parallel and Distributed Machine Learning and Data Mining(ECML/PKDD03), 35-46, 2003.
17. K. D. Bollacker et al, "A supra-classifier architecture for scalable knowledge reuse," Proc. 15th International Conf. on Machine Learning, 64-72, 1998.
18. A. Strehl et al, "Cluster Ensembles - A Knowledge Reuse Framework for Combining Multiple Partitions," Journal on Machine Learning Research (JMLR), 3:583-617, 2002.
19. E. L. Johnson et al, "Collective, Hierarchical Clustering from Distributed, Heterogeneous Data," Large-Scale Parallel Data Mining, 221-244, 1999.
20. N. F. Samatova et al,"RACHET:AnEfficient Cover-Based Merging of Clustering Hierarchies from Distributed Datasets," Distrib. Parallel Databases, 11(2):157-180, 2002.
21. T. Lindholm, "A three-way merge for XML documents," Symposium on Document Engineering, 2004.
22. T. Mens, "A State-of-the-Art Survey on Software Merging," IEEE Trans. Softw. Eng., 28(5):449-462, 2002.
23. S. M. Selkow, "The tree-to-tree editing problem," Information processing letters, 184-186, 1977. [24] K. Zhang, "A Constrained Edit Distance Between Unordered Labeled Trees," Algorithmica, 15(3):205-222, 1996.
24. K. Zhang et al, "Some MAX SNP-hard results concerning unordered labeled trees," Inf. Process. Lett., 49(5):249-254, 1994.
25. Y. Kalfoglou et al, "Ontology Mapping: The State of the Art," Semantic Interoperability and Integration, 2005.
26. P. Shvaiko et al, "A Survey of Schema-Based Matching Approaches," J. Data Semantics IV, 146-171, 2005.
27. X. Sun et al, "Online B-tree merging," SIGMOD '05: Proceedings of the 2005 ACM SIGMOD international conference on Management of data, 335-346, 2005.