• Journal of Advanced Navigation Technology
• /
• v.20 no.6
• /
• pp.617-624
• /
• 2016

The hangul word embedding should be performed certainly process for noun extraction. Otherwise, it should be trained words that are not necessary, and it can not be derived efficient embedding results. In this paper, we propose model that can retrieve more efficiently by query language expansion using hangul word embedded, apriori, and text mining. The word embedding and apriori is a step expanding query language by extracting association words according to meaning and context for query language. The hangul text mining is a step of extracting similar answer and responding to the user using noun extraction, TF-IDF, and cosine similarity. The proposed model can improve accuracy of answer by learning the answer of specific domain and expanding high correlation query language. As future research, it needs to extract more correlation query language by analysis of user queries stored in database.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6A
• /
• pp.500-505
• /
• 2009

In this paper, We present a low complexity candidate list generation scheme in iterative MIMO receiver. Since QAM modulation can be decomposed into HP symbols and LP symbol and HP symbol is robust in error capability, we generate HP symbol list with simple ZF detector output and its corresponding neighbor HP symbols, Then, based on HP symbol list, the LP symbol list is generated by using the sphere decoder. From the second iteration, since apriori value from channel decoder is available, the candidate list is updated based on demodulated apriori value. Through the simulation, we observe that at the first iteration, the BER performance is worse than LSD. However, as the number of iteration is increased, the proposed scheme has almost same performance as LSD. Moreover, the proposed one has reduced candidate list generation time and lower number of candidate list compared with LSD.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.23 no.4
• /
• pp.283-308
• /
• 2012

With explosive growth of information by recent advancements in information technology and the Internet, users need a method to acquire appropriate information. To solve this problem, an information retrieval and filtering system was developed as an important tool for users. Also, users and service providers are growing more and more interested in personalized information recommendation. This study designed and implemented personalized information recommendation system based on AR as a method to provide positive information service for information users as a method to provide positive information service. To achieve the goal, the proposed method overcomes the weaknesses of existing systems, by providing a personalized recommendation method for contents that works in a large-scaled data and user environment. This study based on the proposed method to extract rules from log files showing users' behavior provides an effective framework to extract Association Rule.

• Journal of Intelligence and Information Systems
• /
• v.28 no.4
• /
• pp.287-308
• /
• 2022

The explosive growth of cryptocurrency, led by Bitcoin has emerged as a major issue in the financial market recently. As a result, interest in cryptocurrency investment is increasing, but the market opens 24 hours and 365 days a year, price volatility, and exponentially increasing number of cryptocurrencies are provided as risks to cryptocurrency investors. For that reasons, It is raising the need for research to reduct investors' risks by dividing cryptocurrency which is not suitable for recommendation. Unlike the previous studies of maximizing returns by simply predicting the future of cryptocurrency prices or constructing cryptocurrency portfolios by focusing on returns, this paper reflects the tendencies of investors and presents an appropriate recommendation method with interpretation that can reduct investors' risks by selecting suitable Altcoins which are recommended using Apriori algorithm, one of the machine learning techniques, but based on the similarity and association rules of Bitocoin.

• Journal of Internet of Things and Convergence
• /
• v.9 no.1
• /
• pp.77-87
• /
• 2023

Applying various association rule mining algorithms to the network intrusion detection task involves two critical issues: too large size of generated rule set which is hard to be utilized for IoT systems and hardness of control of false negative/positive rates. In this research, we propose an association rule mining algorithm based on the newly defined measures called coverage and exclusion. Coverage shows how frequently a pattern is discovered among the transactions of a class and exclusion does how frequently a pattern is not discovered in the transactions of the other classes. We compare our algorithm experimentally with the Apriori algorithm which is the most famous algorithm using the public dataset called KDDcup99. Compared to Apriori, the proposed algorithm reduces the resulting rule set size by up to 93.2 percent while keeping accuracy completely. The proposed algorithm also controls perfectly the false negative/positive rates of the generated rules by parameters. Therefore, network analysts can effectively apply the proposed association rule mining to the network intrusion detection task by solving two issues.

• The Journal of the Korea Contents Association
• /
• v.20 no.3
• /
• pp.223-234
• /
• 2020

This research is the association rule analysis using Apriori algorithm of data mining focusing on 32 predictive key words extracted from Hong (2019) affecting successful aging in Korea. And, to examine rules and patterns of those key words or predictive variables, this research used support, confidence, and lift. The data was analyzed with the R version 3. 5. 1 program, and visualized using arulesViz package and visNetwork. It was found that the variables highly associated with successful aging in Korea were 'hobby', 'volunteer service', 'preparation', and 'exercise'. This research concludes that, the variable which needs to be considered first of all for successful aging in Korea is 'hobby', followed by 'volunteer service', 'preparation', and 'exercise'.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.454-457
• /
• 2005

Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous studies adopt an Apriori-like candidate set generation-and-test approach. However, candidate set generation is still costly, especially when there exist prolific patterns and/or long patterns. And calendar based on temporal association rules proposes the discovery of association rules along with their temporal patterns in terms of calendar schemas, but this approach is also adopt an Apriori-like candidate set generation. In this paper, we propose an efficient temporal frequent pattern mining using TFP-tree (Temporal Frequent Pattern tree). This approach has three advantages: (1) this method separates many partitions by according to maximum size domain and only scans the transaction once for reducing the I/O cost. (2) This method maintains all of transactions using FP-trees. (3) We only have the FP-trees of I-star pattern and other star pattern nodes only link them step by step for efficient mining and the saving memory. Our performance study shows that the TFP-tree is efficient and scalable for mining, and is about an order of magnitude faster than the Apriori algorithm and also faster than calendar based on temporal frequent pattern mining methods.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.1 s.16
• /
• pp.27-35
• /
• 2006

As the increasing interest about geographical information, such researches and applied fields become wide. OGC(Open GIS Consortium) developed GML(Geography Markup Language) which is adopted XML(extensible Markup Language) in GIS field. In various applied field, GML is used and studied continuously. This paper try to find out the meaningful rules using Apriori algorithm from GML documents, one of the data mining techniques which is studied based on existing XML documents There are two ways to find out the rules. One is the way that find out the related rules as extracting the content in GML documents, the other find out the related rules based on used tags and attributes. This paper describes searching the rules through two ways and shows the system adopted two ways.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09b
• /
• pp.23-26
• /
• 2003

In this paper, a methodolgy for customizing web pages for indivisual users is suggested. It shows an efficient way to personalize web pages by predicting one's site access pattern. In addition, the prediction can reflect one's tendency after actual purchase. By using the APRIORI algorithm, one of the association rule search methods, the associativity among the purchase items can be inferred. This inferrence is based on the log data in a web server and database about purchase. Finally, a web page which contains the relationship, relative links on other web pages, and inferred items can be generated after this process.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2007.05a
• /
• pp.246-254
• /
• 2007

최근 유비쿼터스 환경이 대두됨에 따라 정보의 밀도가 높아지고 있으며, 기업에서는 고객이 제품을 구매함과 동시에 고객의 정보를 저장하여 활용할 수 있게 되었다. 이와 같은 환경은 고객의 요구사항을 사전에 미리 파악하여 적절한 시점과 상황에 맞는 정보를 전달할 수 있도록 하는 추천시스템에 대한 필요성을 증대시켰으며, 다양한 영역에서 추천시스템과 관련된 연구들이 활발하게 이루어지고 있다. 지금까지의 추천시스템은 주로 제품 중심으로 논의되어 왔으나, 유비쿼터스 시장 환경에서는 매장에 대한 논의가 필요하게 되었다. 이는 고객이 다양한 매장을 방문할 수 있으며, 동일한 제품이라도 여러 매장에 동시에 존재할 수 있고, 매장 간의 동선이나 매장의 위치 및 분위기, 제품의 품질이나 가격 등에 대한 개인 선호도에 따라 같은 제품이라도 선호하는 매장은 다를 수 있기 때문이다. 따라서 본 연구에서는 고객의 선호도를 기반으로 유비쿼터스 시장 환경에 적합한 매장 추천시스템을 제안하고자 한다. 매장 추천시스템은 협업 필터링을 기반으로 하고 있으며, Apriori 알고리즘을 이용하여 관련성이 높은 매장들의 집합을 찾아 추천한다. 이 시스템은 기업보다는 고객 중심의 서비스를 제공해 줌으로써 고객의 쇼핑 효율성을 제고시킬 뿐 아니라 장기적인 관점에서 시장 활성화에 기여할 수 있을 것으로 기대한다.