• Journal of Creative Information Culture
• /
• v.4 no.3
• /
• pp.221-230
• /
• 2018

Collaborative filtering technique is a major method of recommender systems and has been successfully implemented and serviced in real commercial online systems. However, this technique has several inherent drawbacks, such as data sparsity, cold-start, and scalability problem. Clustering-based collaborative filtering has been studied in order to handle scalability problem. This study suggests a collaborative filtering system which utilizes genetic algorithms to improve shortcomings of K-means algorithm, one of the widely used clustering techniques. Moreover, different from the previous studies that have targeted for optimized clustering results, the proposed method targets the optimization of performance of the collaborative filtering system using the clustering results, which practically can enhance the system performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.6
• /
• pp.1728-1742
• /
• 2023

In this paper, we extended a hierarchical clustering technique, which is the most researched in the sensor network field, and studied a dynamic differential clustering technique to minimize energy consumption and ensure equal lifespan of all sensor nodes while considering the mobility of sinks. In a sensor network environment with mobile sinks, clusters close to the sinks tend to consume more forwarding energy. Therefore, clustering that considers forwarding energy consumption is desired. Since all clusters form a hierarchical tree, the number of levels of the tree must be considered based on the size of the cluster so that the cluster size is not growing abnormally, and the energy consumption is not concentrated within specific clusters. To verify that the proposed DDC protocol satisfies these requirements, a simulation using Matlab was performed. The FND (First Node Dead), LND (Last Node Dead), and residual energy characteristics of the proposed DDC protocol were compared with the popular clustering protocols such as LEACH and EEUC. As a result, it was shown that FND appears the latest and the point at which the dead node count increases is delayed in the DDC protocol. The proposed DDC protocol presents 66.3% improvement in FND and 13.8% improvement in LND compared to LEACH protocol. Furthermore, FND improved 79.9%, but LND declined 33.2% when compared to the EEUC. This verifies that the proposed DDC protocol can last for longer time with more number of surviving nodes.

• Journal of IKEEE
• /
• v.4 no.2 s.7
• /
• pp.233-240
• /
• 2000

This paper presents fuzzy clustering and wavelet transform analysis based technique for the industrial hourly load forecasting fur the purpose of peak demand control. Firstly, one year of historical load data were sorted and clustered into several groups using fuzzy clustering and then wavelet transform is adopted using the Biorthogonal mother wavelet in order to forecast the peak load of one hour ahead. The 5-level decomposition of the daily industrial load curve is implemented to consider the weather sensitive component of loads effectively. The wavelet coefficients associated with certain frequency and time localization is adjusted using the conventional multiple regression method and the components are reconstructed to predict the final loads through a five-scale synthesis technique. The outcome of the study clearly indicates that the proposed composite model of fuzzy clustering and wavelet transform approach can be used as an attractive and effective means for the industrial hourly peak load forecasting.

• Journal of the Institute of Convergence Signal Processing
• /
• v.14 no.4
• /
• pp.231-234
• /
• 2013

This paper introduces a mixture of background subtraction technique and K-Means clustering algorithm for removing shadows from video sequences. Lighting conditions cause an issue with segmentation. The proposed method can successfully eradicate artifacts associated with lighting changes such as highlight and reflection, and cast shadows of moving object from segmentation. In this paper, K-Means clustering algorithm is applied to the foreground, which is initially fragmented by background subtraction technique. The estimated shadow region is then superimposed on the background to eliminate the effects that cause redundancy in object detection. Simulation results depict that the proposed approach is capable of removing shadows and reflections from moving objects with an accuracy of more than 95% in every cases considered.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.49 no.5
• /
• pp.269-277
• /
• 2000

We propose two new types multi-stage blind clustering equalizers for QAM demoulation, which are called a complex classification algorithm(CCA) and a radial basis function algorithm(RBFA). The CCA uses a clustering technique based on the joint gaussian probability function and computes separately the real part and imaginary part for simple implementation as well as less computation. In order to improve the performance of CCA, the Dual-Mode CCA(DMCCA) incorporates the CCA tap-updating mode with the decision-directed(DD) mode. The RBFA reduces the number of cluster centers through three steps using the classification technique of RBF and then updates the equalizer taps for QAM demodulation. Test results on 16-QAM confirm that the proposed algorithms perform better the conventional multi-state equalizers in the senses of SER and MSE under multi-path fading channel.

• International Journal of Computer Science & Network Security
• /
• v.21 no.6
• /
• pp.207-212
• /
• 2021

Clustering Unlabeled Spatial-datasets to convert them to Labeled Spatial-datasets is a challenging task specially for geographical information systems. In this research study we investigated the NYC Taxi Limousine Commission dataset and discover that all of the spatial-temporal trajectory are unlabeled Spatial-datasets, which is in this case it is not suitable for any data mining tasks, such as classification and regression. Therefore, it is necessary to convert unlabeled Spatial-datasets into labeled Spatial-datasets. In this research study we are going to use the Clustering Technique to do this task for all the Trajectory datasets. A key difficulty for applying machine learning classification algorithms for many applications is that they require a lot of labeled datasets. Labeling a Big-data in many cases is a costly process. In this paper, we show the effectiveness of utilizing a Clustering Technique for labeling spatial data that leads to a high-accuracy classifier.

• Journal of applied mathematics & informatics
• /
• v.41 no.6
• /
• pp.1327-1339
• /
• 2023

World Wide Web (WWW) use has been increasing recently due to users needing more information. Lately, there has been a growing trend in the document information available to end users through the internet. The web's document search process is essential to find relevant documents for user queries.As the number of general web pages increases, it becomes increasingly challenging for users to find records that are appropriate to their interests. However, using existing Document Information Retrieval (DIR) approaches is time-consuming for large document collections. To alleviate the problem, this novel presents Spatial Clustering Ranking Pattern (SCRP) based Density Ant Colony Information Retrieval (DACIR) for user queries based DIR. The proposed first stage is the Term Frequency Weight (TFW) technique to identify the query weightage-based frequency. Based on the weight score, they are grouped and ranked using the proposed Spatial Clustering Ranking Pattern (SCRP) technique. Finally, based on ranking, select the most relevant information retrieves the document using DACIR algorithm.The proposed method outperforms traditional information retrieval methods regarding the quality of returned objects while performing significantly better in run time.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.5 no.2
• /
• pp.1-11
• /
• 2009

This study presents HCWS algorithm for researcher grouping on a weighted researcher network. The weights represent intensity of connections among researchers based on the number of co-authors and the number of co-authored research papers. To confirm the validity of the proposed technique, this study conducted an experimentation on about 80 research papers. As a consequence, it is proved that HCWS algorithm is able to bring about more realistic clustering compared with HCS algorithm which presents semantic relations among researchers in simple connections. In addition, it is found that HCWS algorithm can address the problems of existing HCS algorithm; researchers are disconnected since their connections are classified as weak even though they are strong, and vise versa. The technique described in this research paper can be applied to efficiently establish social networks of researchers considering relations such as collaboration histories among researchers or to create communities of researchers.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.9
• /
• pp.2961-2975
• /
• 2022

The Location-Based Service (LBS) is one of the most well-known services on the Internet. Positioning is the primary association with LBS services. This study proposes an intelligent LoRa-based positioning system, called AI@LBS, to provide accurate location data. The fingerprint mechanism with the clustering algorithm in unsupervised learning filters out signal noise and improves computing stability and accuracy. In this study, data noise is filtered using the DBSCAN (Density-Based Spatial Clustering of Applications with Noise) algorithm, increasing the positioning accuracy from 95.37% to 97.38%. The problem of data imbalance is addressed using the SMOTE (Synthetic Minority Over-sampling Technique) technique, increasing the positioning accuracy from 97.38% to 99.17%. A field test in the NTUST campus (www.ntust.edu.tw) revealed that AI@LBS system can reduce average distance error to 0.48m.

• Communications for Statistical Applications and Methods
• /
• v.25 no.3
• /
• pp.263-274
• /
• 2018

One of the common issues in large dataset analyses is to detect and construct homogeneous groups of objects in those datasets. This is typically done by some form of clustering technique. In this study, we present a divisive hierarchical clustering method for two monothetic characteristics of histogram data. Unlike classical data points, a histogram has internal variation of itself as well as location information. However, to find the optimal bipartition, existing divisive monothetic clustering methods for histogram data consider only location information as a monothetic characteristic and they cannot distinguish histograms with the same location but different internal variations. Thus, a divisive clustering method considering both location and internal variation of histograms is proposed in this study. The method has an advantage in interpreting clustering outcomes by providing binary questions for each split. The proposed clustering method is verified through a simulation study and applied to a large U.S. house property value dataset.