• Journal of KIISE
• /
• v.42 no.12
• /
• pp.1611-1622
• /
• 2015

Although Android systems provide a permission-based access control mechanism and demand a user to decide whether to install an app based on its permission list, many users tend to ignore this phase. Thus, an improved method is necessary for users to intuitively make informed decisions when installing a new app. In this paper, with regard to the permission-based access control system, we present a novel approach based on a machine-learning technique in order to support a user decision-making on the fly. We apply the K-NN (K-Nearest Neighbors) classification algorithm with necessary weighted modifications for malicious app classification, and use 152 Android permissions as features. Our experiment shows a superior classification result (93.5% accuracy) compared to other previous work. We expect that our method can help users make informed decisions at the installation step.

• The Journal of Korean Association of Computer Education
• /
• v.5 no.3
• /
• pp.37-44
• /
• 2002

Automatic text classification is a task of assigning predefined categories to free text documents. Its importance is increased to organize and manage a huge amount of text data. There have been some researches on automatic text classification based on machine learning techniques. While most of them was focused on proposal of a new machine learning methods and cross evaluation between other systems, a through evaluation or optimization of a method has been rarely been done. In this paper, we propose an improving method of kNN-based Korean text classification system using heuristic informations about decision function, the number of nearest neighbor, and feature selection method. Experimental results showed that the system with similarity-weighted decision function, global method in considering neighbors, and DF/ICF feature selection was more accurate than simple kNN-based classifier. Also, we found out that the performance of the local method with well chosen k value was as high as that of the global method with much computational costs.

• Journal of IKEEE
• /
• v.24 no.1
• /
• pp.120-126
• /
• 2020

We present a user recognition method using human body impulse response signals. The body compositions vary from person to person depending on the portion of water, muscle, and fat. In the body communication study, the body has been interpreted circuit models using capacitance and resistances, and its characteristics are determined by the body compositions. Therefore, the individual body channel is unique and can be used for user recognition. In this paper, we applied pseudo impulse signals to the left hand and recorded received signals from the right hand. The empirical mode decomposition (EMD) method removed noise from the received signals and 10 peak values are extracted. We set the differences between peak amplitudes as a key feature to identify individuals. We collected data from 6 subjects and achieved accuracy of 97.71% for the user recognition application.

• Journal of the Korean Institute of Gas
• /
• v.23 no.4
• /
• pp.19-27
• /
• 2019

The consumption of liquefied natural gas (LNG) has increased annually due to the strengthening of international environmental regulations. In order to produce stable and efficient LNG, it is essential to divide the global (overall) operating condition and construct a quick and accurate monitoring system for each operation condition. In this study, multi-mode monitoring system is proposed to the LNG plant fractionation process. First, global normal operation data is divided to local (subdivide) normal operation data using global principal component analysis (PCA) and k-means clustering method. And then, the data to be analyzed were matched with the local normal mode. Finally, it is determined the state of process abnormality through the local PCA. The proposed method is applied to 45 fault case and it proved to be more than 5~10% efficient compared to the global PCA and univariate monitoring.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.6
• /
• pp.622-627
• /
• 2014

This paper proposes a new method which improves recognition rate on the gait recognition system using wavelet transform, linear discriminant analysis and genetic algorithm. We use wavelet transform to obtain the four sub-bands from the gait energy image. In order to extract feature data from sub-bands, we use linear discriminant analysis. Distance values between training data and four sub-band data are calculated and four weights which are calculated by genetic algorithm is assigned at each sub-band distance. Based on a new fusion distance value, we conducted recognition experiments using k-nearest neighbors algorithm. Experimental results show that the proposed weight fusion method has higher recognition rate than conventional method.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.2
• /
• pp.61-68
• /
• 2012

Recommender Systems have gained much popularity among researchers and is applied in a number of applications. The exponential growth of users and products poses some key challenges for recommender systems. Recommender Systems mostly suffer from scalability and accuracy. The accuracy of Recommender system is somehow inversely proportional to its scalability. In this paper we proposed a Context Aware Hybrid Recommender System using matrix reduction for Hybrid model and clustering technique for predication of item features. In our approach we used user item-feature rating, User Demographic information and context information i.e. specific time and day to improve scalability and accuracy. Our Algorithm produce better results because we reduce the dimension of items features matrix by using different reduction techniques and use user demographic information, construct context aware hybrid user model, cluster the similar user offline, find the nearest neighbors, predict the item features and recommend the Top N- items.

• Journal of the Korean Society for information Management
• /
• v.20 no.3
• /
• pp.111-127
• /
• 2003

The purpose of this study is to ascertain whether event tracking is more effective in event retrieval than information filtering. This study examined the two techniques for event retrieval to suggest the more effective one. The event-retrieval performances of the event tracking technique based on a kNN classifier and the query-based information filtering technique were compared. Two event tracking experiments, one with the static training set and the other with the dynamic training set , were carried out. Two information filtering experiments, one with initial queries and the other with refined queries, were also carried out to evaluate the event-retrieval effectiveness. We found that the event tracking technique with the static training set performed better than on with the dynamic training set. It was also found that the information fitering technique using intial queries performed better than one using the refined queries. In conclusion, the comparison of the best cases of event tracking and information filtering revealed that the information filtering technique outperformed the event tracking technique in event retrieval.

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.726-730
• /
• 2009

The proliferation of the web and digital photography has drastically increased multimedia data and has resulted in the need of the high quality internet service based on the moving picture like user generated contents(UGC). The keyword-based search on large scale images and video collections is too expensive and requires much manual intervention. Therefore the web search engine may provide the content-based retrieval on the multimedia data for search accuracy and customer satisfaction. In this paper, we propose a novel distributed index structure based on multiple length signature files according to data distribution. In addition, we describe how our scalable index technique can be used to find the nearest neighbors in the cluster environments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.10
• /
• pp.1862-1878
• /
• 2011

With the advances in wireless communication technology and the advent of smartphones, research on location-based services (LBSs) is being actively carried out. In particular, several spatial index methods have been proposed to provide efficient LBSs. However, finding an optimal indexing method that balances query performance and index size remains a challenge in the case of wireless environments that have limited channel bandwidths and device resources (computational power, memory, and battery power). Thus, mechanisms that make existing spatial indexing techniques more efficient and highly applicable in resource-limited environments should be studied. Bitmap-based Spatial Indexing (BSI) has been designed to support LBSs, especially in wireless broadcast environments. However, the access latency in BSI is extremely large because of the large size of the bitmap, and this may lead to increases in the search time. In this paper, we introduce a Selective Bitmap-based Spatial Indexing (SBSI) technique. Then, we propose an Adaptive Bitmap-based Spatial Indexing (ABSI) to improve the tuning time in the proposed SBSI scheme. The ABSI is applied to the distribution of geographical objects in a grid by using the Hilbert curve (HC). With the information in the ABSI, grid cells that have no objects placed, (i.e., 0-bit information in the spatial bitmap index) are not tuned during a search. This leads to an improvement in the tuning time on the client side. We have carried out a performance evaluation and demonstrated that our SBSI and ABSI techniques outperform the existing bitmap-based DSI (B DSI) technique.

• Journal of Internet Computing and Services
• /
• v.10 no.4
• /
• pp.1-11
• /
• 2009

Recently there has arisen concern in both the database community and the graphics society about data retrieval from large motion databases because the high dimensionality of motion data implies high costs. In this circumstance, finding an effective distance measure and an efficient query processing method for such data is a challenging problem. This paper presents an elaborate motion query processing system, SMoFinder (Similar Motion Finder), which incorporates a novel kinematic distance measure and an efficient indexing strategy via adaptive frame segmentation. To this end, we regard human motions as multi-linkage kinematics and propose the weighted Minkowski distance metric. For efficient indexing, we devise a new adaptive segmentation method that chooses representative frames among similar frames and stores chosen frames instead of all frames. For efficient search, we propose a new search method that processes k-nearest neighbors queries over only representative frames. Our experimental results show that the size of motion databases is reduced greatly (${\times}1/25$) but the search capability of SMoFinder is equal to or superior to that of other systems.