A new distributed data mining model based on similarity

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2003, Pages 432-436

  Li, Tao ^a   Zhu, Shenghuo ^a   Ogihara, Mitsunori ^a  

^a University of Rochester   (United States)

Author keywords

Distributed Data Mining(DDM); SBDDM; Similarity

Indexed keywords

COMPUTER SCIENCE; DATABASE SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; LEARNING ALGORITHMS;

DISTRIBUTED DATA MINING (DDM);

DATA MINING;

EID: 0037928941     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/952613.952618     Document Type: Conference Paper

References (23)

1. Aggarwal, C. C., Wolf, J. L., Yu, P. S., Procopiuc, C., & Park, J. S. (1999). Fast algorithms for projected clustering. ACM SIGMOD Conference (pp. 61-72).
2. Agrawal, R., Imielinski, T., & Swami, A. (1993). Mining associations between sets of items in massive databases. ACM-SIGMOD-1993 (pp. 207-216).
3. Burdick, D., Calimlim, M., & Gehrke, J. (2001). MAFIA: A maximal frequent itemset algorithm for transactional databases. ICDE (pp. 443-452).
4. Chan, P. C., & Stolfo, S. (1993). Meta-learning for multistrategy and parallel learning. Proceedings of the Second International Workshop on Multistrategy Learning.
5. Cheung, D. W., Ng, V. T., Fu, A. W., & Fu, Y. J. (1996). Efficient mining of association rules in distributed databases. IEEE Trans. On Knowledge and Data Engineering, 8, 911-922.
6. Cho, V., & Wuthrich, B. (1998). Towards real time discovery from distributed information sources. PAKDD.
7. Das, G., Gunopulos, D., & Mannila, H. (1997). Finding similar time series. Principles of Data Mining and Knowledge Discovery (pp. 88-100).
8. Das, G., & Mannila, H. (2000). Context-based similarity methods for categorical attributes. PKDD (pp. 201-211).
9. Ganti, V., Gehrke, J., & Ramakrishnan, R. (1999). A framework for measuring changes in data characteristics. Proceedings of 18th Symposium on Principles of Database Systems (pp. 126-137). ACM Press.
10. Gouda, K., & Zaki, M. J. (2001). Efficiently mining maximal frequent itemsets. ICDM.
11. Kargupta, H., & Chan, P. (Eds.). (2000). Advances in distributed and parallel data mining. AAAI Press.
12. Kargupta, H., Park, B., Hershbereger, D., & Johnson, E. (2000). Collective data mining: A new perspective toward distributed data mining. In H. Kargupta and P. Chan (Eds.), Advances in distributed data mining, 133-184. AAAI/MIT.
13. Lam, W., & Segre, A. M. (1997). Distributed data mining of probabilistic knowledge. ICDCS.
14. Li, T., Ogihara, M., & Zhu, S. (2002). Similarity testing between heterogeneous basket databases (Technical Report 781). Computer Science, Univ. of Rochester.
15. Parthasarathy, S., & Ogihara, M. (2000). Clustering distributed homogeneous datasets. PKDD.
16. R. Wirth, M. B., & Hipp, J. (2001). When distribution is part of the semantics: A new problem class for distributed knowledge discovery. In Proceedings of workshop on Ubiquitous Data Mining for Mobile and Distributed Environments, PKDD/ECML 2001.
17. Rafiei, D., & Mendelzon, A. (1997). Similarity-based queries for time series data (pp. 13-25.).
18. Ronkainen, R. (1998). Attribute similarity and event sequence similarity in data mining. Ph.lic. thesis, University of Helsinki. Available as Report C-1998-42, University of Helsinki, Department of Computer Science, October 1998.
19. Subramonian, R. (1998). Defining diff as a data mining primitive. KDD.
20. Turinsky, A., & Grossman, R. (2000). A framework for finding distributed data mining strategies that are intermediate between centralized strategies and in-place strategies. Proc. of KDD Workshop on Distributed Data Mining.
21. Yamanishi, K. (1997). Distributed cooperative bayesian learning strategies. Proceedings of COLT 97 (pp. 250-262). New York: ACM.
22. Zaki, M., & Ho, C. (Eds.). (2000). Large-scale parallel data mining. Springer.
23. Zhu, S., Li, T., & Ogihara, M. (2002). CoFD: An algorithm for non-distance based clustering in high dimensional spaces. DaWaK.