다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기
韓國컴퓨터情報學會論文誌 = Journal of the Korea Society of Computer and Information, v.14 no.10, 2009년, pp.251 - 258
노영상 (충북대학교, 컴퓨터공학) , 윤은일 (충북대학교 전자정보대학 컴퓨터) , 김명준 (충북대학교 전자정보대학 컴퓨터)
AI-Helper
Data mining is a method that extract useful knowledges from huge size of data. Recently, a focussing research part of data mining is to find interesting patterns in graph databases. More efficient methods have been proposed in graph mining. However, graph analysis methods are in NP-hard problem. Gra...
R. Agrawal. T. Imilienski. and A. Swami, "Mining association rules between sets of items in large datasets." In Proceedings of SIGMOD 1993.
T. Asai, K Abe, S. Kawasoe, H. Arimura. H. Sakamoto, S. Arikawa "Efficient substructure discovery from large semi-structured data." In Proceedings of KDD'04 SIAM SDM'02, April 2002,
J. Han and M. Kamber. "Data Mining: Concepts and Techniques." Morgan Kaufmann. Publishers, 2005.
J. Huan, W. Wang, Jan Prins "Efficient mining of frequent subgraphs in the presence of isomorphism." In Proceedings of the Third IEEE International Conference on Data Mining (ICDM'03)
J. Huan, W. Wang, J. Prins, J. Yang "SPIN: mining maximal frequent subgraphs from graph databases," KDD'04: In Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
A. Inokuchi. Takashi Washio, Hiroshi Motoda "An apriori-based algorithm for mining frequent substructures from graph data." In Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Disco (2000)
M. Kuramoehi and G. Karypis. "An Efficient Algorithm for Discovering Frequent Subgraphs," In Proceedings of IEEE Trans. Knowl. Data Eng. 16(9): 1038-1051. 2004.
S. Niissen. J, N. Kok "A quickstart in frequent structure mining can make a difference," In Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining (KDD'04)
N. Vanetik, E. Gudes. "Mining Frequent Labeled and Partially Labeled Graph Patterns," In Proceedings of the International Conference on Data Engineering 2004 (ICDE2004). 2004.
X. Yan, J. Han "gSpan: Graph-based substructure pattern mining." In Proceedings of the 2002 IEEE International Conference on Data Mining
X. Yan, J. Han "CloseGraph: Mining Closed Frequent Graph Patterns," In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, 2003.
F. Zhu, X. Yan, J. Han, P. S. Yu "gPrune: A Constraint Pushing Framework for Graph Pattern Mining,H In Proceedings of Pacific-Asia Conf. on Knowledge Discovery and Data Mining (PAKDD' 07)
산사볼트가람라흐차, 황영섭, "근사 알고리즘을 이용한 순차패턴 탐색." 한국컴퓨터정보학회 논문지, 제 14권, 제 5호, 29-36쪽, 2009년 5월.
오승준, "데이터마이닝의 자동 데이터 규칙 추출 방법론 개발: 계층적 클러스터링 알고리듬과 러프 셋 이론을 중심으로." 한국컴퓨터정보학회 논문지, 제 14권, 제 6호, 135-142쪽, 2009년 6월.
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
Free Access. 출판사/학술단체 등이 허락한 무료 공개 사이트를 통해 자유로운 이용이 가능한 논문
Copyright KISTI. All Rights Reserved.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.