• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.160-162
• /
• 2004

기존의 웹 문서 분류 시스템서는 많은 시간과 노력을 요구하며, 연관 단어가 아닌 단일 단어만으로 웹 문서들을 분류하여 단어의 중의성을 반영하지 못해 많은 오분류가 있었다. 이러한 문제점을 해결하기 위해 본 논문에서는 협력적 필터링을 위한 연관 단어 빈도를 사용한 웹 문서 분류 방법을 제안한다. 제안된 방법에서는 웹 문서 내에서 단어들을 추출하고 빈도 가중치를 계산한다. 추출된 단어를 Apriori 알고리즘에 의해 연관 규칙을 생성하고 신뢰도에 단어 빈도 가중치를 반영한다. 수정된 신뢰도를 ARHP 알고리즘에 적용하여 연관 단어들 사이의 유사정도를 계산하고 유사 클래스를 구성한다 생성된 유사 클래스들을 기반으로 웹 문서를 $\alpha$-cut을 이용하여 분류한다 성능평가를 위해 기존의 문서 분류 방법들과 비교 평가를 하였다.

• Journal of Korea Multimedia Society
• /
• v.7 no.2
• /
• pp.145-155
• /
• 2004

It is very important for Internet searching systems to have user-friendly and rapid searching functions at the managers'point of view. The former finds optimized input parameters to support the various searching requirements of user. The latter has fast searching results which are effectively normalized to various input parameters having different attributes. In this paper we basically focus on optimized database construction not only to have searching functions with multiple attributes to support maximal various input requirements of the user but also to have more rapid searching functions. For this research, we suggest a modified association algorithm that takes into consideration to the support and confidence that is the criteria of the association mining rule in order to reflect the searching characteristics of internet shopping malls. We also propose the model management systems for rapid searching functions. The following results are from a processed simulation: the more the number of searching transactions of the users increase, the less the total relative average searching time becomes.

• The Journal of the Korea Contents Association
• /
• v.8 no.1
• /
• pp.282-289
• /
• 2008

Although there were some technological developments in improving the collaborative filtering, they have yet to fully reflect the actual relation of the items. In this paper, we propose the recommendation system using associative web document classification by word frequency and ${\alpha}$-cut to address the short comings of the collaborative filtering. The proposed method extracts words from web documents through the morpheme analysis and accumulates the weight of term frequency. It makes associative rules and applies the weight of term frequency to its confidence by using Apriori algorithm. And it calculates the similarity among the words using the hypergraph partition. Lastly, it classifies related web document by using ${\alpha}$-cut and calculates similarity by using adjusted cosine similarity. The results show that the proposed method significantly outperforms the existing methods.

• Annual Conference of KIPS
• /
• 2008.11a
• /
• pp.336-339
• /
• 2008

우리가 사용하는 데이터베이스 내에는 많은 양의 데이터 들이 들어 있으며, 계속적으로 그 양은 늘어나고 있다. 이러한 데이터들로부터 질의를 통해 얻을 수 있는 기본적이고 단순한 정보들과 달리 고급 정보를 얻게 해주는 방법이 데이터 마이닝이다. 데이터 마이닝의 기법 중에서 본 논문에서는 k-means 알고리즘을 사용하여 트랜잭션을 클러스터링 함으로써 데이터베이스의 트랜잭션 수를 줄여 연관규칙의 대표적인 알고리즘인 Apriori 알고리즘의 단점인 트랜잭션 스캔으로 인한 성능 저하를 개선하고자 한다.

• The Journal of Korean Association of Computer Education
• /
• v.11 no.1
• /
• pp.65-74
• /
• 2008

In this paper, we introduce an analysis system for answer dataset by using a data mining method. We analyze students' answer data collected from a test including multiple choice question items, and find associations between the items. Analysis of evaluation results based on our system will not only provide correct information on students' achievement levels but also provides a basis for modifying weaknesses of the evaluation procedures, question items, or teaching/learning procedures. Furthermore, it will enable us to improve the quality of question items for future use so that we can secure itemsets of high quality.

• Journal of the Korean Society for information Management
• /
• v.39 no.3
• /
• pp.1-22
• /
• 2022

The purpose of this study is to propose a book recommendation system that can be used in school libraries. The book recommendation system applies an algorithm based on association rules using DLS lending data and is designed to provide personalized book recommendation services to school library users. For this purpose, association rules based on the Apriori algorithm and betweenness centrality analysis were applied and detailed functions such as descriptive statistics, generation of association rules, student-centered recommendation, and book-centered recommendation were materialized. Subsequently, opinions on the use of the book recommendation system were investigated through in-depth interviews with teacher librarians. As a result of the investigation, opinions on the necessity and difficulty of book recommendation, student responses, differences from existing recommendation methods, utilization methods, and improvements were confirmed and based on this, the following discussions were proposed. First, it is necessary to provide long-term lending data to understand the characteristics of each school. Second, it is necessary to discuss the data integration plan by region or school characteristics. Third, It is necessary to establish a book recommendation system provided by the Comprehensive Support System for Reading Education. Based on the contents proposed in this study, it is expected that various discussions will be made on the application of a personalization recommendation system that can be used in the school library in the future.

• The Journal of Korean Association of Computer Education
• /
• v.9 no.1
• /
• pp.71-80
• /
• 2006

As e-commerce developing rapidly, it is becoming a research focus about how to find customer's behavior patterns and realize commerce intelligence by use of Web mining technology. One of the most successful and widely used technologies for building personalization and goods recommendation system is collaborating filtering. However, collaborative filtering have serious data sparsity problem. Traditional association rule does not consider user's interests or preferences to provide a user with specific personalized service.In this paper, we propose an goods recommendation system, which is integrated an collaborative filtering algorithm with item-to-item corelation and an improved Apriori algorithm. This system has user's interests or preferences ro provide a user with specific personalized service.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10b
• /
• pp.63-65
• /
• 2000

웹 개인화 기술의 발달은 많은 업체들이 기존 고객의 유지와 신규 고객의 확보를 위한 수단을 제공하였다. 현재의 개인화 기술은 크게 내용 기반 그리고 협력적 정보 여과 방식에 기반한 기술로 나뉘어질 수 있다. 내용 기반 정보 여과 방식에 기반한 개인화 기술은 멀티미디어 정보로 표현된 대부분의 웹 오브젝트(페이지, 이미지, 동영상, 사운드, 상품 등)에는 적용하기 어렵고, 협력적 정보 여과방식은 Cold Start Problem과 단일 도메인내에서의 개인화 서비스만이 가능하다는 문제점이 있다. 본 논문에서는 협력적 정보 여과 방식과 데이터 마이닝 기술 중의 연관 규칙 생성 방법을 혼합한 웹 개인화 시스템을 제안한다. 다양한 멀티미디어 형태로 표현되는 웹 오브젝트의 내용 분석이 어려우므로, 각각의 오브젝트를 하나의 아이템으로 인식하고 개인화 서비스를 시도하는 협력적 정보 여과 방식을 채택하였다. 협력적 정보 여과의 결과로 발견된 도메인별 유사 사용자의 웹 오브젝트 사용 정보를 연관 규칙 생성 알고리즘에 적용하여 오브젝트간의 연관성을 발견한다. 발견된 오브젝트간의 연관성은 서로 다른 정보 도메인의 오브젝트가 현재 사용자에게 흥미있는 것인가를 예측할 수 있는 자료로서 사용될 수 있다. 협력적 정보 여과 방식에 의해 생성된 오브젝트의 선호도값과 오브젝트 연관성 정보를 비교하여 사용자에게 개인화된 웹 서비스를 제공한다.

• Journal of KIISE:Software and Applications
• /
• v.33 no.4
• /
• pp.365-377
• /
• 2006

Proteins are known to perform a biological function by interacting with other proteins or compounds. Since protein interaction is intrinsic to most cellular processes, prediction of protein interaction is an important issue in post-genomic biology where abundant interaction data have been produced by many research groups. In this paper, we present an associative feature mining method to predict implicit protein-protein interactions of Saccharomyces cerevisiae from public protein interaction data. We discretized continuous-valued features by maximal interdependence-based discretization approach. We also employed feature dimension reduction filter (FDRF) method which is based on the information theory to select optimal informative features, to boost prediction accuracy and overall mining speed, and to overcome the dimensionality problem of conventional data mining approaches. We used association rule discovery algorithm for associative feature and rule mining to predict protein interaction. Using the discovered associative feature we predicted implicit protein interactions which have not been observed in training data. According to the experimental results, the proposed method accomplished about 96.5% prediction accuracy with reduced computation time which is about 29.4% faster than conventional method with no feature filter in association rule mining.

• Journal of KIISE:Databases
• /
• v.35 no.3
• /
• pp.199-207
• /
• 2008

The FP-tree(Frequency Pattern Tree) mining association rules algorithm was proposed to improve mining performance by reducing DB scan overhead dramatically, and it is recognized that the performance of it is better than that of any other algorithms based on different approaches. But the FP-tree algorithm needs a few more memory because it has to store all transactions including frequent itemsets of the DB. This paper implements a FP-tree algorithm on a general purpose UNK system and compares it with the DHP(Direct Hashing and Pruning) algorithm which uses hash tree and direct hash table from the point of memory usage and execution time. The results show surprisingly that the FP-tree algorithm is poor than the DHP algorithm in some cases even if the system memory is sufficient for the FP-tree. The characteristics of the test data are as follows. The site of DB is look, the number of total items is $1K{\sim}7K$, avenrage length of transactions is $5{\sim}10$, avergage size of maximal frequent itemsets is $2{\sim}12$(these are typical attributes of data for large-scale convenience stores).