• Proceedings of the KSRS Conference
• /
• 2008.10a
• /
• pp.406-409
• /
• 2008

Clustering data streams has an importance over many applications like sensor networks. Existing hierarchical methods follow a semi fuzzy clustering that yields duplicate clusters. In order to solve the problems, we propose an extended online divisive agglomerative clustering on data streams. It builds a tree-like top-down hierarchy of clusters that evolves with data streams using geometric time frame for snapshots. It is an enhancement of the Online Divisive Agglomerative Clustering (ODAC) with a pruning strategy to avoid duplicate clusters. Our main features are providing update time and memory space which is independent of the number of examples on data streams. It can be utilized for clustering sensor data and network monitoring as well as web click streams.

• ETRI Journal
• /
• v.43 no.1
• /
• pp.74-81
• /
• 2021

The mixture model is a very powerful and flexible tool in clustering analysis. Based on the Dirichlet process and parsimonious Gaussian distribution, we propose a new nonparametric mixture framework for solving challenging clustering problems. Meanwhile, the inference of the model depends on the efficient online variational Bayesian approach, which enhances the information exchange between the whole and the part to a certain extent and applies to scalable datasets. The experiments on the scene database indicate that the novel clustering framework, when combined with a convolutional neural network for feature extraction, has meaningful advantages over other models.

• Journal of Computing Science and Engineering
• /
• v.5 no.4
• /
• pp.346-353
• /
• 2011

With the advent of ubiquitous computing, a massive amount of trajectory data has been published and shared in many websites. This type of computing also provides motivation for online mining of trajectory data, to fit user-specific preferences or context (e.g., time of the day). While many trajectory clustering algorithms have been proposed, they have typically focused on offline mining and do not consider the restrictions of the underlying road network and selection conditions representing user contexts. In clear contrast, we study an efficient clustering algorithm for Boolean + Clustering queries using a pre-materialized and summarized data structure. Our experimental results demonstrate the efficiency and effectiveness of our proposed method using real-life trajectory data.

• Journal of Information Processing Systems
• /
• v.9 no.4
• /
• pp.633-650
• /
• 2013

All the imputation techniques proposed so far in literature for data imputation are offline techniques as they require a number of iterations to learn the characteristics of data during training and they also consume a lot of computational time. Hence, these techniques are not suitable for applications that require the imputation to be performed on demand and near real-time. The paper proposes a computational intelligence based architecture for online data imputation and extended versions of an existing offline data imputation method as well. The proposed online imputation technique has 2 stages. In stage 1, Evolving Clustering Method (ECM) is used to replace the missing values with cluster centers, as part of the local learning strategy. Stage 2 refines the resultant approximate values using a General Regression Neural Network (GRNN) as part of the global approximation strategy. We also propose extended versions of an existing offline imputation technique. The offline imputation techniques employ K-Means or K-Medoids and Multi Layer Perceptron (MLP)or GRNN in Stage-1and Stage-2respectively. Several experiments were conducted on 8benchmark datasets and 4 bank related datasets to assess the effectiveness of the proposed online and offline imputation techniques. In terms of Mean Absolute Percentage Error (MAPE), the results indicate that the difference between the proposed best offline imputation method viz., K-Medoids+GRNN and the proposed online imputation method viz., ECM+GRNN is statistically insignificant at a 1% level of significance. Consequently, the proposed online technique, being less expensive and faster, can be employed for imputation instead of the existing and proposed offline imputation techniques. This is the significant outcome of the study. Furthermore, GRNN in stage-2 uniformly reduced MAPE values in both offline and online imputation methods on all datasets.

• Journal of Information Processing Systems
• /
• v.15 no.2
• /
• pp.359-373
• /
• 2019

For clustering large-scale data, which cannot be loaded into memory entirely, incremental clustering algorithms are very popular. Usually, these algorithms only concern the within-cluster compactness and ignore the between-cluster separation. In this paper, we propose two incremental fuzzy compactness and separation (FCS) clustering algorithms, Single-Pass FCS (SPFCS) and Online FCS (OFCS), based on a fuzzy scatter matrix. Firstly, we introduce two incremental clustering methods called single-pass and online fuzzy C-means algorithms. Then, we combine these two methods separately with the weighted fuzzy C-means algorithm, so that they can be applied to the FCS algorithm. Afterwards, we optimize the within-cluster matrix and betweencluster matrix simultaneously to obtain the minimum within-cluster distance and maximum between-cluster distance. Finally, large-scale datasets can be well clustered within limited memory. We implemented experiments on some artificial datasets and real datasets separately. And experimental results show that, compared with SPFCM and OFCM, our SPFCS and OFCS are more robust to the value of fuzzy index m and noise.

• Journal of Digital Convergence
• /
• v.20 no.2
• /
• pp.217-223
• /
• 2022

Subspace clustering for online data streams requires a large amount of memory resources as all subsets of data dimensions must be examined. In order to track the continuous change of clusters for a data stream in a finite memory space, in this paper, we propose a grid-based subspace clustering algorithm that effectively uses memory resources. Given an n-dimensional data stream, the distribution information of data items in data space is monitored by a grid-cell list. When the frequency of data items in the grid-cell list of the first level is high and it becomes a unit grid-cell, the grid-cell list of the next level is created as a child node in order to find clusters of all possible subspaces from the grid-cell. In this way, a maximum n-level grid-cell subspace tree is constructed, and a k-dimensional subspace cluster can be found at the k^th level of the subspace grid-cell tree. Through experiments, it was confirmed that the proposed method uses computing resources more efficiently by expanding only the dense space while maintaining the same accuracy as the existing method.

• Journal of KIISE:Software and Applications
• /
• v.31 no.11
• /
• pp.1431-1438
• /
• 2004

Reinforcement learning learns policies for accomplishing a task's goal by experience through interaction between agent and environment. Q-learning, basis algorithm of reinforcement learning, has the problem of curse of dimensionality and slow learning speed in the incipient stage of learning. In order to solve the problems of Q-learning, new function approximation methods suitable for reinforcement learning should be studied. In this paper, to improve these problems, we suggest Fuzzy Q-Map algorithm that is based on online fuzzy clustering. Fuzzy Q-Map is a function approximation method suitable to reinforcement learning that can do on-line teaming and express uncertainty of environment. We made an experiment on the mountain car problem with fuzzy Q-Map, and its results show that learning speed is accelerated in the incipient stage of learning.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.190-207
• /
• 2015

In the combustion engineering, to decrease pollution and increase production efficiency, and to optimally keep solid burning material amount constant in a burner online, it needs a smart method to detect the amount variation of the burning materials in a high temperature environment. This paper presents an online machine vision system for automatically measuring and detecting the burning material amount inside a burner or a boiler. In the camera-protecting box of the system, a sub-system for cooling is constructed by using the cooling water circulation techqique. In addition, the key and intelligent step in the system is to detect the pile profile of the variable burning material, and the algorithm for the pile profile tracing was studied based on the combination of the gey level (color) discontinuity and similarity based image segmentation methods, the discontinuity based sub-algorithm is made on the quaternion convolution, and the similarity based sub-algorithm is designed according to the region growing with multi-scale clustering. The results of the two sub-algoritms are fused to delineate the final pile profile, and the algorithm has been tested and applied in different industrial burners and boilers. The experiements show that the proposed algorithm works satisfactorily.

• The Journal of the Korea Contents Association
• /
• v.12 no.12
• /
• pp.733-741
• /
• 2012

In recent, many consumers visit the online shopping malls or price comparison sites to collect the information on the product category that they are interested in. However, the volumes of the data provided by such web sites are often too enormous, and significant number of consumers have trouble in making purchase decision based on the plethora of products and sellers. In this context, modern online shopping agents need to process the retrieved information in more intelligent way before providing them to the users. This paper proposes a novel approach for identifying the main price ranges hidden in a single product category. To this end, the price of an item in the category is represented as a row vector and k-means clustering analysis is applied to the price vectors to produce the clusters that consists of the product items with similar price vectors. Then, the main price ranges of the product category can be identified from the result of clustering analysis. In general, the price is one of the most important factors in the consumers' purchase decision, and the identified main price ranges will be helpful for the online shoppers to find appropriate items effectively.

• Asian Journal for Public Opinion Research
• /
• v.5 no.4
• /
• pp.266-284
• /
• 2018

This paper adopts the big data research method, and draws 491 data from the Tianya Forum about the Simultaneous Renting and Purchasing policy of Guangzhou. The qualitative analysis software Nvivo11 is used to cluster the main questions about the Simultaneous Renting and Purchasing policy in the forum. The 36 high-frequency word frequencies are obtained through text clustering. Through rooted theory analysis, the main driving factors for summarizing people's doubts are 9 main categories, 3 core categories, and the model of driving factors for online forums is established. The study finds that resource factors are the most key factor, economic factors are the important drivers, and policy guiding factors are sub-important drivers.