• KEPCO Journal on Electric Power and Energy
• /
• v.2 no.1
• /
• pp.61-69
• /
• 2016

Understanding load patterns and customer classification is a basic step in analyzing the behavior of electricity consumers. To achieve that, there have been many researches about clustering customers' daily load data. Nowadays, the deployment of advanced metering infrastructure (AMI) and big-data technologies make it easier to study customers' load data. In this paper, we study load clustering from the view point of yearly and daily load pattern. We compare four clustering methods; K-means clustering, hierarchical clustering (average & Ward's method) and DBSCAN (Density-Based Spatial Clustering of Applications with Noise). We also discuss the relationship between clustering results and Korean Standard Industrial Classification that is one of possible labels for customers' load data. We find that hierarchical clustering with Ward's method is suitable for clustering load data and KSIC can be well characterized by daily load pattern, but not quite well by yearly load pattern.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.55 no.10
• /
• pp.410-417
• /
• 2006

Generally, the training set of maximum $m{\times}L(m+f)$ patterns in the pattern recognition method is required for the real-time bus reconfiguration strategy when a main transformer fault occurs in the distribution substation. Accordingly, to make the application of pattern recognition method possible, the size of the training set must be reduced as efficient level. This Paper proposes a methodology which obtains the minimized training set by applying the pattern clustering method to load patterns of the main transformers and feeders during selected period and to obtain bus reconfiguration strategy based on it. The MaxMin distance clustering algorithm is adopted as the pattern clustering method. The proposed method reduces greatly the number of load patterns to be trained and obtain the satisfactory pattern matching success rate because that it generates the typical pattern clusters by appling the pattern clustering method to load patterns of the main transformers and feeders during selected period. The proposed strategy is designed and implemented in Visual C++ MFC. Finally, availability and accuracy of the proposed methodology and the design is verified from diversity simulation reviews for typical distribution substation.

• International Journal of Contents
• /
• v.2 no.3
• /
• pp.11-17
• /
• 2006

The Clustering is representative method of components classification. The previous clustering methods that use cohesion and coupling cannot be effective because design pattern has focused on relation between classes. In this paper, we classified design patterns with features of object-oriented relationship. The result is that classification by clustering showed higher precision than classification by facet. It is effective that design patterns are classified by automatic clustering algorithm. When patterns are retrieved in classification of design patterns, we can use to compare them because similar pattern is saved to same category. Also we can manage repository efficiently because of storing patterns with link information.

• Journal of Information Technology Applications and Management
• /
• v.17 no.1
• /
• pp.127-139
• /
• 2010

Customer behavior pattern discovery is the fundament for conducting customer oriented services and the services management. But, the composition, need, interest and experience of customers may be continuously changing, thereof lead to the difficulty in refining a stable description of their consistent behavior pattern. This paper presented a new method for the behavior pattern discovery from a changing collection of customers. It was originally inspired from the swarm intelligence of ant colony. By the adaptive clustering, some typical behavior patterns which reflect the characteristics of related customer clusters can extracted dynamically and adaptively.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.11
• /
• pp.17-24
• /
• 2011

Collaborative filtering system is the clustering about user is built and then based on that clustering results will recommend the preferred item to the user. However, building user clustering is time consuming and also once the users evaluate and give feedback about the film then rebuilding the system is not simple. In this paper, genre pattern of movie recommendation systems is being used and in order to simplify and reduce time of rebuilding user clustering. A Frequent pattern networks is used and then extracts user preference genre patterns and through that extracted patterns user clustering will be built. Through built the clustering for all neighboring users to collaborative filtering is applied and then recommends movies to the user. When receiving user information feedback, traditional collaborative filtering is to rebuild the clustering for all neighbouring users to research and do the clustering. However by using frequent pattern Networks, through user clustering based on genre pattern, collaborative filtering is applied and when rebuilding user clustering inquiry limited by search time can be reduced. After receiving user information feedback through proposed user clustering based on genre pattern, the time that need to spent on re-establishing user clustering can be reduced and also enable the possibility of traditional collaborative filtering systems and recommendation of a similar performance.

• Journal of Communications and Networks
• /
• v.17 no.6
• /
• pp.568-581
• /
• 2015

Predicting locations of users with portable devices such as IP phones, smart-phones, iPads and iPods in public wireless local area networks (WLANs) plays a crucial role in location management and network resource allocation. Many techniques in machine learning and data mining, such as sequential pattern mining and clustering, have been widely used. However, these approaches have two deficiencies. First, because they are based on profiles of individual mobility behaviors, a sequential pattern technique may fail to predict new users or users with movement on novel paths. Second, using similar mobility behaviors in a cluster for predicting the movement of users may cause significant degradation in accuracy owing to indistinguishable regular movement and random movement. In this paper, we propose a novel fusion technique that utilizes mobility rules discovered from multiple similar users by combining clustering and sequential pattern mining. The proposed technique with two algorithms, named the clustering-based-sequential-pattern-mining (CSPM) and sequential-pattern-mining-based-clustering (SPMC), can deal with the lack of information in a personal profile and avoid some noise due to random movements by users. Experimental results show that our approach outperforms existing approaches in terms of efficiency and prediction accuracy.

• Journal of Information Processing Systems
• /
• v.15 no.4
• /
• pp.986-1016
• /
• 2019

Mobile user interface pattern (MUIP) is a kind of structured representation of interaction design knowledge. Several studies have suggested that MUIPs are a proven solution for recurring mobile interface design problems. To facilitate MUIP selection, an effective clustering method is required to discover hidden knowledge of pattern data set. In this paper, we employ the semi-supervised kernel fuzzy c-means clustering (SSKFCM) method to cluster MUIP data. In order to improve the performance of clustering, clustering parameters are optimized by utilizing the global optimization capability of particle swarm optimization (PSO) algorithm. Since the PSO algorithm is easily trapped in local optima, a novel PSO algorithm is presented in this paper. It combines an improved intuitionistic fuzzy entropy measure and a new population search strategy to enhance the population search capability and accelerate the convergence speed. Experimental results show the effectiveness and superiority of the proposed clustering method.

• Smart Structures and Systems
• /
• v.8 no.1
• /
• pp.69-92
• /
• 2011

This paper presents an emergent pattern recognition approach based on the immune network theory and hierarchical clustering algorithms. The immune network allows its components to change and learn patterns by changing the strength of connections between individual components. The presented immune-network-based approach achieves emergent pattern recognition by dynamically generating an internal image for the input data patterns. The members (feature vectors for each data pattern) of the internal image are produced by an immune network model to form a network of antibody memory cells. To classify antibody memory cells to different data patterns, hierarchical clustering algorithms are used to create an antibody memory cell clustering. In addition, evaluation graphs and L method are used to determine the best number of clusters for the antibody memory cell clustering. The presented immune-network-based emergent pattern recognition (INEPR) algorithm can automatically generate an internal image mapping to the input data patterns without the need of specifying the number of patterns in advance. The INEPR algorithm has been tested using a benchmark civil structure. The test results show that the INEPR algorithm is able to recognize new structural damage patterns.

• The KIPS Transactions:PartB
• /
• v.9B no.3
• /
• pp.319-326
• /
• 2002

In this paper, we have designed and implemented cluttering classification systems- unsupervised classifiers-for the processing of satellite remote sensing images. Implemented systems adopt various design patterns which include a factory pattern and a strategy pattern to support various satellite images'formats and to design compatible systems. The clustering systems consist of sequential clustering, K-Means clustering, ISODATA clustering and Fuzzy C-Means clustering classifiers. The systems are tested by using a Landsat TM satellite image for the classification input. As results, these clustering systems are well designed to extract sample data for the classification of satellite images of which there is no previous knowledge. The systems can be provided with real-time base clustering tools, compatibilities and components' reusabilities as well.

• 한국데이터정보과학회:학술대회논문집
• /
• 2005.10a
• /
• pp.59-69
• /
• 2005

Data mining technique is used to find hidden knowledge by massive data, unexpectedly pattern, relation to new rule. The methods of data mining are decision tree, association rules, clustering, neural network and so on. Clustering is the process of grouping the data into clusters so that objects within a cluster have high similarity in comparison to one another. It has been widely used in many applications, such that pattern analysis or recognition, data analysis, image processing, market research on off-line or on-line and so on. We analyze Gyeongnam social indicator survey data by 2001 using twostep clustering technique for environment information. The twostep clustering is classified as a partitional clustering method. We can apply these twostep clustering outputs to environmental preservation and improvement.