[논문]Contribution to Improve Database Classification Algorithms for Multi-Database Mining

Miloudi, Salim; Rahal, Sid Ahmed; Khiat, Salim

doi:10.3745/jips.04.0075

Contribution to Improve Database Classification Algorithms for Multi-Database Mining 원문보기

Journal of information processing systems, v.14 no.3, 2018년, pp.709 - 726

Miloudi, Salim (Dept. of Computer Science, Faculty of Computer Science and Mathematics, University of Sciences and Technology-Mohamed Boudiaf (USTOMB)) , Rahal, Sid Ahmed (Dept. of Computer Science, Faculty of Computer Science and Mathematics, University of Sciences and Technology-Mohamed Boudiaf (USTOMB)) , Khiat, Salim (Dept. of Computer Science, Faculty of Computer Science and Mathematics, University of Sciences and Technology-Mohamed Boudiaf (USTOMB))

Abstract ▼ AI-Helper

Database classification is an important preprocessing step for the multi-database mining (MDM). In fact, when a multi-branch company needs to explore its distributed data for decision making, it is imperative to classify these multiple databases into similar clusters before analyzing the data. To search for the best classification of a set of n databases, existing algorithms generate from 1 to ($n^2-n$)/2 candidate classifications. Although each candidate classification is included in the next one (i.e., clusters in the current classification are subsets of clusters in the next classification), existing algorithms generate each classification independently, that is, without taking into account the use of clusters from the previous classification. Consequently, existing algorithms are time consuming, especially when the number of candidate classifications increases. To overcome the latter problem, we propose in this paper an efficient approach that represents the problem of classifying the multiple databases as a problem of identifying the connected components of an undirected weighted graph. Theoretical analysis and experiments on public databases confirm the efficiency of our algorithm against existing works and that it overcomes the problem of increase in the execution time.

주제어

참고문헌 (14)

S. Zhang and M. J. Zaki, "Mining multiple data sources: local pattern analysis," Data Mining and Knowledge Discovery, vol. 12, no. 2-3, pp. 121-125, 2006.

상세보기
S. Zhang, X. Wu, and C. Zhang, "Multi-database mining," IEEE Computational Intelligence Bulletin, vol. 2, no. 1, pp. 5-13, 2003.
S. Zhang, C. Zhang, and X. Wu, Knowledge Discovery in Multiple Databases. New York, NY: Springer, 2004.
A. Adhikari, P. Ramachandrarao, and W. Pedrycz, Developing Multi-database Mining Applications. London: Springer, 2010.
X. Wu, C. Zhang, and S. Zhang, "Database classification for multi-database mining," Information Systems, vol. 30, no. 1, pp. 71-88, 2005.

상세보기
H. Li, X. Hu, and Y. Zhang, "An improved database classi？cation algorithm for multi-database mining," in Frontiers in Algorithmics. Heidelberg: Springer, 2009, pp. 346-357.
A. Adhikari and P. R. Rao, "Efficient clustering of databases induced by local patterns," Decision Support Systems, vol. 44, no. 4, pp. 925-943, 2008.

상세보기
Y. Liu, D. Yuan, and Y. Cuan, "Completely clustering for multi-databases mining," Journal of Computational Information Systems, vol. 9, no. 16, pp. 6595-6602, 2013.
H. Liu, H. Lu, and J. Yao, "Identifying relevant databases for multidatabase mining," in Research and Development in Knowledge Discovery and Data Mining. Heidelberg: Springer, 1998, pp. 15-18.
H. Liu, H. Lu, and J. Yao, "Toward multi-database mining: identifying relevant databases," IEEE Transactions on Knowledge and Data Engineering, vol. 13, no. 4, pp. 541-553, 2001.

상세보기
R. Agrawal and J. C. Shafer, "Parallel mining of association rules," IEEE Transactions on Knowledge and Data Engineering, vol. 8, no. 6, pp. 962-969, 1996.

상세보기
R. Agrawal and R. Srikant, "Fast algorithms for mining association rules in large databases," in Proceedings of the 20th International Conference on Very Large Data Bases, Santiago de Chile, Chile, 1994, pp. 487-499.
J. Han, J. Pei, Y. Yin, and R. Mao, "Mining frequent patterns without candidate generation: a frequent-pattern tree approach," Data Mining and Knowledge Discovery, vol. 8, no. 1, pp. 53-87, 2004.

상세보기
T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. Cambridge, MA: MIT Press, 1990.

내보내기 구분	파일저장 인쇄 메일전송
구성항목	기본정보 상세정보 관리번호, 논문명, 저널/프로시딩명, 저자 , 발행년, 권, 호, 시작페이지, 끝페이지, 발행기관 관리번호, 논문명, 대등논문명, 저자 , 저널/프로시딩명, 발행기관, 발행년, 발행언어, 권, 호, 시작페이지, 끝페이지, ISBN, ISSN, 주제분야, 키워드, 초록(한글), 초록(영문), 저자(소속기관)
저장형식	Text(ASCII format) Excel format RefWorks Direct Export RIS format (for Reference Manager, ProCite, EndNote), Scholar's Aids, Mendeley
메일정보	받는사람 (필수) @ 보내는사람 (선택) @ 제목 내용 KISTI 검색결과 이메일 서비스
안내	총 건의 자료가 검색되었습니다. 다운받으실 자료의 인덱스를 입력하세요. (1-10,000) 검색결과의 순서대로 최대 10,000건 까지 다운로드가 가능합니다. 데이타가 많을 경우 속도가 느려질 수 있습니다.(최대 2~3분 소요) 다운로드 파일은 UTF-8 형태로 저장됩니다. 파일의 내용이 제대로 보이지 않을실 때는 웹브라우저 상단의 보기 -> 인코딩 -> 자동선택 여부를 확인하십시오. ~ Text(ASCII format) Excel format

연합인증

Contribution to Improve Database Classification Algorithms for Multi-Database Mining 원문보기

Abstract ▼ AI-Helper

주제어

참고문헌 (14)

이 논문을 인용한 문헌

관련 콘텐츠

원문 보기

원문 URL 링크

오픈액세스(OA) 유형

이 논문과 함께 이용한 콘텐츠

AI-Helper ※ AI-Helper는 오픈소스 모델을 사용합니다.

선택된 텍스트