• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.11
• /
• pp.2269-2274
• /
• 2009

Customer clustering method is used to make a TDLP (typical daily load profile) to estimate the quater hourly load profile of non-AMR (Automatic Meter Reading) customer. In this paper, repeated small-sized clustering method is supposed to improve the classifying ability of TDLP. K-means algorithm is well-known clustering technology of data mining. To reduce the local maxima of k-means algorithm, proposed method clusters average load profiles to small-sized clusters and selects the highest error rated cluster and clusters this to small-sized clusters repeatedly to minimize the local maxima.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.5
• /
• pp.536-541
• /
• 2014

Data through meteorological radar includes ground echo, sea-clutter echo, anomalous propagation echo, clear echo and so on. Each echo is a kind of non-precipitation echoes and the characteristic of individual echoes is analyzed in order to identify with non-precipitation. Meteorological radar data is analyzed through pre-processing procedure because the data is given as big data. In this study, echo pattern classifier is designed to distinguish non-precipitation echoes from precipitation echo in meteorological radar data using RBFNNs and echo judgement module. Output performance is compared and analyzed by using both HCM clustering-based RBFNNs and FCM clustering-based RBFNNs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.3
• /
• pp.1238-1259
• /
• 2019

Saving energy is a big challenge for Wireless Sensor Networks (WSNs), which becomes even more critical in large-scale WSNs. Most energy waste is communication related, such as collision, overhearing and idle listening, so the schedule-based access which can avoid these wastes is preferred for WSNs. On the other hand, clustering technique is considered as the most promising solution for topology management in WSNs. Hence, providing interference-free clustering is vital for WSNs, especially for large-scale WSNs. However, schedule management in cluster-based networks is never a trivial work, since it requires inter-cluster cooperation. In this paper, we propose a clustering method, called Interference-Free Clustering Protocol (IFCP), to partition a WSN into interference-free clusters, making timeslot management much easier to achieve. Moreover, we model the clustering problem as a multi-objective optimization issue and use non-dominated sorting genetic algorithm II to solve it. Our proposal is finally compared with two adaptive clustering methods, HEED-CSMA and HEED-BMA, demonstrating that it achieves the good performance in terms of delay, packet delivery ratio, and energy consumption.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.612-614
• /
• 2022

This paper propose a clustering algorithm for mobile nodes that possible more efficient clustering using context-aware attribute information in adaptive learning. In typically, the data will be provided to classify interrelationships within cluster properties. If a new properties are treated as contaminated information in comparative clustering, it can be treated as contaminated properties in comparison clustering. In this paper, To solve this problems in this paper, we have new present a context-awareness learning based model that can analyzes the clustering attributed parameters from the node properties using accumulated information properties.

• Journal of Advanced Navigation Technology
• /
• v.13 no.1
• /
• pp.151-155
• /
• 2009

We proposes a new method using the non-negative matrix factorization (NMF) and clustering method to extract the sentences for personalized document summarization. The proposed method uses clustering method for retrieving documents to extract sentences which are well reflected topics and sub-topics in document. Beside it can extract sentences with respect to query which are well reflected user interesting by using the inherent semantic features in document by NMF. The experimental results shows that the proposed method achieves better performance than other methods use the similarity and the NMF.

• International journal of advanced smart convergence
• /
• v.1 no.2
• /
• pp.30-33
• /
• 2012

This paper propose a new design of fuzzy neural networks based on hard partition to generate the rules of the networks. For this we use hard c-means (HCM) clustering algorithm. The premise part of the rules of the proposed networks is realized with the aid of the hard partition of input space generated by HCM clustering algorithm. The consequence part of the rule is represented by polynomial functions. And the coefficients of the polynomial functions are learned by BP algorithm. The number of the hard partition of input space equals the number of clusters and the individual partitioned spaces indicate the rules of the networks. Due to these characteristics, we may alleviate the problem of the curse of dimensionality. The proposed networks are evaluated with the use of numerical experimentation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10a
• /
• pp.25-26
• /
• 2007

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.729-733
• /
• 2003

The presence of local features within clusters incurred by multi-modal nature of data prohibits many conventional clustering techniques from working properly. Especially, the clustering of datasets with non-Gaussian distributions within a cluster can be problematic when the technique with implicit assumption of Gaussian distribution is used. Current study proposes a simple tandem clustering method composed of k-means type algorithm and hierarchical method to solve such problems. The multi-modal dataset is first divided into many small pre-clusters by k-means or fuzzy k-means algorithm. The pre-clusters found from the first step are to be clustered again using agglomerative hierarchical clustering method with Kullback- Leibler divergence as the measure of dissimilarity. This method is not only effective at extracting the multi-modal clusters but also fast and easy in terms of computation complexity and relatively robust at the presence of outliers. The performance of the proposed method was evaluated on three generated datasets and six sets of publicly known real world data.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.3
• /
• pp.337-340
• /
• 2004

The clustering problem can be formulated as the problem to find the number of clusters and a partition matrix from a given data set using the iterative or non-iterative algorithms. The author proposes a nearest neighbor and validity-based clustering algorithm where each data point in the data set is linked with the nearest neighbor data point to form initial clusters and then a cluster in the initial clusters is linked with the nearest neighbor cluster to form a new cluster. The linking between clusters is continued until no more linking is possible. An optimal set of clusters is identified by using the conventional cluster validity index. Experimental results on well-known data sets are provided to show the effectiveness of the proposed clustering algorithm.

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

Despite many successful spectral clustering algorithm (based on the spectral decomposition of Laplacian(1) or stochastic matrix(2) ) there are several unsolved problems. Most spectral clustering Problems are based on the normalized of algorithm(3) . are close to the classical graph paritioning problem which is NP-hard problem. To get good solution in polynomial time. it needs to establish its convex form by using relaxation. In this paper, we apply a novel optimization technique. semidefinite programming(SDP). to the unsupervised clustering Problem. and present a new multiple Partitioning method. Experimental results confirm that the Proposed method improves the clustering performance. especially in the Problem of being mixed with non-compact clusters compared to the previous multiple spectral clustering methods.