• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.413-435
• /
• 2018

Although the accuracy of handwritten character recognition based on deep networks has been shown to be superior to that of the traditional method, the use of an overly deep network significantly increases time consumption during parameter training. For this reason, this paper took the training time and recognition accuracy into consideration and proposed a novel handwritten character recognition algorithm with newly designed network structure, which is based on an extended nonlinear kernel residual network. This network is a non-extremely deep network, and its main design is as follows:(1) Design of an unsupervised apriori algorithm for intra-class clustering, making the subsequent network training more pertinent; (2) presentation of an intermediate convolution model with a pre-processed width level of 2;(3) presentation of a composite residual structure that designs a multi-level quick link; and (4) addition of a Dropout layer after the parameter optimization. The algorithm shows superior results on MNIST and SVHN dataset, which are two character benchmark recognition datasets, and achieves better recognition accuracy and higher recognition efficiency than other deep structures with the same number of layers.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.1
• /
• pp.127-136
• /
• 2009

This paper proposes an on-line mining algorithm of moving trajectory patterns in RFID data streams considering changing characteristics over time and constraints of single-pass data scan. Since RFID, sensor, and mobile network technology have been rapidly developed, many researchers have been recently focused on the study of real-time data gathering from real-world and mining the useful patterns from them. Previous researches for sequential patterns or moving trajectory patterns based on stream data have an extremely time-consum ing problem because of multi-pass database scan and tree traversal, and they also did not consider the time-changing characteristics of stream data. The proposed method preserves the sequential strength of 2-lengths frequent patterns in binary relationship table using the time-evolving graph to exactly reflect changes of RFID data stream from time to time. In addition, in order to solve the problem of the repetitive data scans, the proposed algorithm infers candidate k-lengths moving trajectory patterns beforehand at a time point t, and then extracts the patterns after screening the candidate patterns by only one-pass at a time point t+1. Through the experiment, the proposed method shows the superior performance in respect of time and space complexity than the Apriori-like method according as the reduction ratio of candidate sets is about 7 percent.

• KIISE Transactions on Computing Practices
• /
• v.22 no.12
• /
• pp.646-653
• /
• 2016

Outbound market is a rapidly growing global industry, and has evolved into a 11 trillion won trade. A lot of recommender systems, which are based on collaborative and content filtering, target the existing purchase log or rely on studies based on similarity of products. These researches are not highly efficient as data was not obtained in advance, and acquiring the overwhelming amount of data has been relatively slow. The characteristics of an outbound product are that it should be purchased at least twice in a year, and its pricing should be in the higher category. Since the repetitive purchase of a product is rare for the outbound market, the old recommender system which profiles the existing customers is lacking, and has some limitations. Therefore, due to the scarcity of data, we suggest an improved customer-profiling method using web usage mining, algorithm of association rule, and rule-based algorithm, for faster recommender system of outbound product.

• The KIPS Transactions:PartB
• /
• v.9B no.4
• /
• pp.389-390
• /
• 2002

It is important that acquire information about if customer has some habit in electronic commerce application of internet base that led in recommendation service for customer in dynamic web contents supply. Collaborative filtering that has been used as a standard approach to Web personalization can not get rapidly user's preference change due to static user profiles and has shortcomings such as reliance on user ratings, lack of scalability, and poor performance in the high-dimensional data. In order to overcome this drawbacks, Web usage mining has been prevalent. Web usage mining is a technique that discovers patterns from We usage data logged to server. Specially. a technique that discovers Web usage patterns and clusters patterns is used. However, the discovery of patterns using Afriori algorithm creates many useless patterns. In this paper, the enhanced method for the construction of dynamic user profiles using validated Web usage patterns is proposed. First, to discover patterns Apriori is used and in order to create clusters for user profiles, ARHP algorithm is chosen. Before creating clusters using discovered patterns, validation that removes useless patterns by Dempster-Shafer theory is performed. And user profiles are created dynamically based on current user sessions for Web personalization.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.3
• /
• pp.155-164
• /
• 2016

For frequency pattern analysis of large databases, the new tree-based frequency pattern analysis algorithm which can compensate for the disadvantages of the Apriori method has been variously studied. In frequency pattern tree, the number of nodes is associated with memory allocation, but also affects memory resource consumption and processing speed of the growth. Therefore, reducing the number of nodes in the tree is very important in the frequency pattern mining. However, the absolute criteria which need to order the transaction items for construction frequency pattern tree has lowered the compression ratio of the tree nodes. But most of the frequency based tree construction methods adapted the absolute criteria. FP-tree is typically frequency pattern tree structure which is an extended prefix-tree structure for storing compressed frequent crucial information about frequent patterns. For construction the tree, all the frequent items in different transactions are sorted according to the absolute criteria, frequency descending order. CanTree also need to absolute criteria, canonical order, to construct the tree. In this paper, we proposed a novel frequency pattern tree construction method that does not use the absolute criteria, IRFP-tree algorithm. IRFP-tree(Intersection Rule based FP-tree). IRFP-tree is constituted with the new paradigm of the intersection rule without the use of the absolute criteria. It increased the compression ratio of the tree nodes, and reduced the tree construction time. Our method has the additional advantage that it provides incremental mining. The reported test result demonstrate the applicability and effectiveness of the proposed approach.

• 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.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.6 no.1
• /
• pp.21-26
• /
• 2006

In this paper, we propose a customer personalized system that presents the web pages to users which are customized to their individuality. It analyzes the action of users who visit the shopping mall, and preferentially supplies the necessary information to them. When they actually buy some items, it forecasts the user's access pattern to web site and their following purchasable items and improves their web page on the bases of their individuality. It reasons the relation among the web documents and among the items by using the log data of web server and the purchase information of DB. For reasoning, it employs Apriori algorithm, which is a method that searches the association rule. It reasons the web pages by considering the user's access pattern and time by using the web log and reasons the user's purchase pattern by using the purchase information of DB. On the basis of the relation among them, it appends the related web pages to link of user's web pages and displays the inferred goods on user's web pages.

• Journal of Information Processing Systems
• /
• v.15 no.3
• /
• pp.520-537
• /
• 2019

This paper proposes a system that can detect the data leakage pattern using a convolutional neural network based on defining the behaviors of leaking data. In this case, the leakage detection scenario of data leakage is composed of the patterns of occurrence of security logs by administration and related patterns between the security logs that are analyzed by association relationship analysis. This proposed system then detects whether the data is leaked through the convolutional neural network using an insider malicious behavior graph. Since each graph is drawn according to the leakage detection scenario of a data leakage, the system can identify the criminal insider along with the source of malicious behavior according to the results of the convolutional neural network. The results of the performance experiment using a virtual scenario show that even if a new malicious pattern that has not been previously defined is inputted into the data leakage detection system, it is possible to determine whether the data has been leaked. In addition, as compared with other data leakage detection systems, it can be seen that the proposed system is able to detect data leakage more flexibly.

• Journal of Korea Game Society
• /
• v.19 no.1
• /
• pp.95-108
• /
• 2019

The purpose of this study is to suggest ways to design gamification to improve the game and digital addiction. For the study, 782 of gmaification cases were collected and game mechanics and fun experience were analyzed by 4F process which is to design the effective gamification. To find the specific pattern, apriori algorithm, which is to find associated rules in transaction is applied to the 782 cases. According to the results, 63 of game mechanics associated rules are found. In the fun experience, 37 of associated rules are found. Based on the result, this study suggest the direction of gamification design for game and digital addiction improvement.

• International Journal of Computer Science & Network Security
• /
• v.23 no.3
• /
• pp.10-16
• /
• 2023

The ever-increasing amount of data generated by various industries and systems has led to the development of data mining techniques as a means to extract valuable insights and knowledge from such data. The electrical energy industry is no exception, with the large amounts of data generated by SCADA systems. This study focuses on the analysis of historical data recorded in the SCADA database of the Libyan Electricity Company. The database, spanned from January 1st, 2013, to December 31st, 2022, contains records of daily date and hour, energy production, temperature, humidity, wind speed, and energy consumption levels. The data was pre-processed and analyzed using the WEKA tool and the Apriori algorithm, a supervised machine learning technique. The aim of the study was to extract association rules that would assist decision-makers in making informed decisions with greater efficiency and reduced costs. The results obtained from the study were evaluated in terms of accuracy and production time, and the conclusion of the study shows that the results are promising and encouraging for future use in the Libyan Electricity Company. The study highlights the importance of data mining and the benefits of utilizing machine learning technology in decision-making processes.