• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.143-145
• /
• 2005

In this paper, an empirical study result on pattern estimation method is devoted to reveal underlying data patterns with a relatively reduced computational cost. Presented method performs crisp type clustering with given n number of data samples by means of the sequential agglomerative hierarchical nested model (SAHN). Conventional SAHN based clustering requires large computation time in the initial step of algorithm. To deal with this concern, we modified overall process with a partial approach. In the beginning of this method, we divide given data set to several sub groups with uniform sampling and then each divided sub data group is applied to SAHN based method. The advantage of this method reduces computation time of original process and gives similar results. Proposed is applied to several test data set and simulation result with conceptual analysis is presented.

• Proceedings of the Korean Society of Soil and Groundwater Environment Conference
• /
• 2005.04a
• /
• pp.296-299
• /
• 2005

Time series of spring discharge data in Jeju island can provide abundant information on the spatial groundwater system. In this study, the classification based on time series of spring discharge was performed with clustering analysis: discharge rate and EC. Peak discharges are mainly observed in august or september. However, double peaks and late peaks of discharge are also observed at a plenty of springs. Based on results of clustering analysis, it can be deduced that GH model is not appropriate for the conceptual model of Groundwater system in Jeju island. EC distributions in dry season are also support the conclusion.

• Speech Sciences
• /
• v.10 no.1
• /
• pp.71-84
• /
• 2003

In the acoustic modeling for large vocabulary speech recognition, a sparse data problem caused by a huge number of context-dependent (CD) models usually leads the estimated models to being unreliable. In this paper, we develop a new clustering method based on the C45 decision-tree learning algorithm that effectively encapsulates the CD modeling. The proposed scheme essentially constructs a supervised decision rule and applies over the pre-clustered triphones using the C45 algorithm, which is known to effectively search through the attributes of the training instances and extract the attribute that best separates the given examples. In particular, the data driven method is used as a clustering algorithm while its result is used as the learning target of the C45 algorithm. This scheme has been shown to be effective particularly over the database of low unknown-context ratio in terms of recognition performance. For speaker-independent, task-independent continuous speech recognition task, the proposed method reduced the percent accuracy WER by 3.93% compared to the existing rule-based methods.

• KIEE International Transactions on Electrophysics and Applications
• /
• v.5C no.3
• /
• pp.138-142
• /
• 2005

In this paper, we compared recognition rates between NN(neural networks) and clustering method as a scheme of off-line PD(partial discharge) diagnosis which occurs at the stator coil of traction motor. To acquire PD data, three defective models are made. PD data for classification were acquired from PD detector. And then statistical distributions are calculated to classify model discharge sources. These statistical distributions were applied as input data of two classification tools, BP(Back propagation algorithm) and ANFIS(adaptive network based fuzzy inference system) pre-processed FCM(fuzzy c-means) clustering method. So, classification rate of BP were somewhat higher than ANFIS. But other items of ANFIS were better than BP; learning time, parameter number, simplicity of algorithm.

• Proceedings of the KIEE Conference
• /
• 2003.07d
• /
• pp.2534-2536
• /
• 2003

Color는 다른 물체로부터 하나의 물체를 특정짓기 위한 효과적이고 강인한 실마리이므로 color clustering이 많은 주목을 받고 있다. 그러나 불규칙한 조명변화에 의한 color 변이 때문에 color segmentation은 매우 어렵다. 이 논문은 B-spline 곡선을 이용한, HSI color space에서의 intensity 정보를 포함한 신뢰할 수 있는 color modeling 방법을 제안한다. 이것은 비록 HS 평균임에도 불구하고 단색 물체의 color 분포가 조명이 변함에따라 변한다는 사실에 기반한다. 이 접근법을 사용하면 피부색을 가진 영역의 color clustering이 불규칙한 조명변화에 적응될 수 있다.

• ETRI Journal
• /
• v.43 no.3
• /
• pp.427-435
• /
• 2021

Data filtering is an essential task for improving the energy efficiency of radiofrequency identification (RFID) networks. Among various energy-efficient approaches, clustering-based data filtering is considered to be the most effective solution because data from cluster members can be filtered at cluster heads before being sent to base stations. However, this approach quickly depletes the energy of cluster heads. Furthermore, most previous studies have assumed that readers are fixed and interrogate mobile tags in a workspace. However, there are several applications in which readers are mobile and interrogate fixed tags in a specific area. This article proposes a model for dynamic clustering-based data filtering (DCDF) in mobile RFID networks, where mobile readers are re-clustered periodically and the cluster head role is rotated among the members of each cluster. Simulation results show that DCDF is effective in terms of balancing energy consumption among readers and prolonging the lifetime of the mobile RFID networks.

• Journal of Information Processing Systems
• /
• v.17 no.1
• /
• pp.163-177
• /
• 2021

Many methods of discovering social networking communities or clustering of features are based on the network structure or the content network. This paper proposes a community discovery method based on topic models using a time factor and an unsupervised clustering method. Online community discovery enables organizations and businesses to thoroughly understand the trend in users' interests in their products and services. In addition, an insight into customer experience on social networks is a tremendous competitive advantage in this era of ecommerce and Internet development. The objective of this work is to find clusters (communities) such that each cluster's nodes contain topics and individuals having similarities in the attribute space. In terms of social media analytics, the method seeks communities whose members have similar features. The method is experimented with and evaluated using a Vietnamese corpus of comments and messages collected on social networks and ecommerce sites in various sectors from 2016 to 2019. The experimental results demonstrate the effectiveness of the proposed method over other methods.

• Journal of Intelligence and Information Systems
• /
• v.21 no.1
• /
• pp.119-142
• /
• 2015

With the explosive growth in the volume of information, Internet users are experiencing considerable difficulties in obtaining necessary information online. Against this backdrop, ever-greater importance is being placed on a recommender system that provides information catered to user preferences and tastes in an attempt to address issues associated with information overload. To this end, a number of techniques have been proposed, including content-based filtering (CBF), demographic filtering (DF) and collaborative filtering (CF). Among them, CBF and DF require external information and thus cannot be applied to a variety of domains. CF, on the other hand, is widely used since it is relatively free from the domain constraint. The CF technique is broadly classified into memory-based CF, model-based CF and hybrid CF. Model-based CF addresses the drawbacks of CF by considering the Bayesian model, clustering model or dependency network model. This filtering technique not only improves the sparsity and scalability issues but also boosts predictive performance. However, it involves expensive model-building and results in a tradeoff between performance and scalability. Such tradeoff is attributed to reduced coverage, which is a type of sparsity issues. In addition, expensive model-building may lead to performance instability since changes in the domain environment cannot be immediately incorporated into the model due to high costs involved. Cumulative changes in the domain environment that have failed to be reflected eventually undermine system performance. This study incorporates the Markov model of transition probabilities and the concept of fuzzy clustering with CBCF to propose predictive clustering-based CF (PCCF) that solves the issues of reduced coverage and of unstable performance. The method improves performance instability by tracking the changes in user preferences and bridging the gap between the static model and dynamic users. Furthermore, the issue of reduced coverage also improves by expanding the coverage based on transition probabilities and clustering probabilities. The proposed method consists of four processes. First, user preferences are normalized in preference clustering. Second, changes in user preferences are detected from review score entries during preference transition detection. Third, user propensities are normalized using patterns of changes (propensities) in user preferences in propensity clustering. Lastly, the preference prediction model is developed to predict user preferences for items during preference prediction. The proposed method has been validated by testing the robustness of performance instability and scalability-performance tradeoff. The initial test compared and analyzed the performance of individual recommender systems each enabled by IBCF, CBCF, ICFEC and PCCF under an environment where data sparsity had been minimized. The following test adjusted the optimal number of clusters in CBCF, ICFEC and PCCF for a comparative analysis of subsequent changes in the system performance. The test results revealed that the suggested method produced insignificant improvement in performance in comparison with the existing techniques. In addition, it failed to achieve significant improvement in the standard deviation that indicates the degree of data fluctuation. Notwithstanding, it resulted in marked improvement over the existing techniques in terms of range that indicates the level of performance fluctuation. The level of performance fluctuation before and after the model generation improved by 51.31% in the initial test. Then in the following test, there has been 36.05% improvement in the level of performance fluctuation driven by the changes in the number of clusters. This signifies that the proposed method, despite the slight performance improvement, clearly offers better performance stability compared to the existing techniques. Further research on this study will be directed toward enhancing the recommendation performance that failed to demonstrate significant improvement over the existing techniques. The future research will consider the introduction of a high-dimensional parameter-free clustering algorithm or deep learning-based model in order to improve performance in recommendations.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.207-209
• /
• 2007

In this paper, we introduce a genetic optimization of fuzzy set-fuzzy model using successive tuning method to carry out the model identification of complex and nonlinear systems. To identity we use genetic alrogithrt1 (GA) sand C-Means clustering. GA is used for determination the number of input, the seleced input variables, the number of membership function, and the conclusion inference type. Information Granules (IG) with the aid of C-Means clustering algorithm help determine the initial paramters of fuzzy model such as the initial apexes of the, membership functions in the premise part and the initial values of polyminial functions in the consequence part of the fuzzy rules. The overall design arises as a hybrid structural and parametric optimization. Genetic algorithms and C-Means clustering are used to generate the structurally as well as parametrically optimized fuzzy model. To identify the structure and estimate parameters of the fuzzy model we introduce the successive tuning method with variant generation-based evolution by means of GA. Numerical example is included to evaluate the performance of the proposed model.

• Health Policy and Management
• /
• v.12 no.2
• /
• pp.1-22
• /
• 2002

Since the early 1980s scholars have applied latent structure and other type of finite mixture models from various academic fields. Although the merits of finite mixture model are well documented, the attempt to apply the mixture model to medical service has been relatively rare. The researchers aim to try to fill this gap by introducing finite mixture model and segmenting inpatients DB from one general hospital. In section 2 finite mixture models are compared with clustering, chi-square analysis, and discriminant analysis based on Wedel and Kamakura(2000)'s segmentation methodology schemata. The mixture model shows the optimal segments number and fuzzy classification for each observation by EM(expectation-maximization algorism). The finite mixture model is to unfix the sample, to Identify the groups, and to estimate the parameters of the density function underlying the observed data within each group. In section 3 and 4 we illustrate results of segmenting 4510 patients data including menial and ratio scales. And then, we show AHP can be identify the attractiveness of each segment, in which the decision maker can select the best target segment.