基于Dirichlet过程的无线视频码率变化识别算法

研究了通过对终端视频帧质量的聚类分析来识别无线视频传输中码率变化的方法,以便为无线视频传输过程中视频码率自适应调整提供参考依据.针对经典模糊C均值(FCM)算法和K均值(K-means)算法需要设定聚类数目的问题,提出一种基于荻利克雷过程(DP)的FCM算法——DP-FCM算法.该算法将Dirichlet过程和FCM算法相结合,由视频帧信息权重峰值信噪比(IWPSNR)值使用DP过程混合模型模拟估计出聚类数目,然后进行FCM模糊聚类,通过设定合理的阈值,合并聚类结果相似项,完成视频帧的聚类,从而实现视频传输码率变化的识别.以LIVE视频库为试验数据源,对该算法进行了性能测试.试验结果表明,DP-FCM算法能够在无需设定聚类数目的前提下实现视频传输码率变化的分类识别.     

量子蚁群模糊聚类算法在图像分割中的应用

针对模糊C-均值算法对初始值的依赖,容易陷入局部最优值的缺点,本文提出将量子蚁群算法与FCM聚类算法结合,首先利用量子蚁群算法的全局性和鲁棒性以及快速收敛的优点确定图像的初始聚类中心和聚类个数,再将所得结果作为FCM聚类算法的初始参数,然后用FCM聚类算法对医学图像进行分割。实验结果表明,该方法有效解决了FCM算法对初始参数的依赖,克服了FCM算法及蚁群算法容易陷入局部极值的的缺点,而且在分割速度和精度上得到了较大提高。     

基于改进蝙蝠优化自确定的模糊C-均值聚类算法

针对模糊C-均值聚类算法敏感于初始聚类中心及聚类收敛慢、聚类数目手动设定等缺陷,提出了基于改进蝙蝠优化自确定的模糊C-均值聚类算法。该算法是基于密度峰值综合衡量聚类中心外围数据密集程度和聚类中心间距离,自动确定聚类中心和聚类数目,以此作为改进蝙蝠算法的初始中心;在原始蝙蝠算法中引入Levy飞行特征加强算法跳出局部最优能力;使用Powell局部搜索加快算法的收敛,利用改进的蝙蝠种群进行种群寻优,并将最优蝙蝠位置作为聚类C-均值新聚类中心,进行模糊聚类,以此循环交叉迭代多次最终获得聚类结果。将基于改进蝙蝠优化自确定的模糊C-均值聚类算法与其它两种聚类算法在标准数据集上进行仿真对比,实验结果表明:与其它两种算法相比,该算法收敛速度快、误差率低。     

基于模糊C均值聚类算法的金刚石砂轮磨粒边缘检测

基于模糊C均值(FCM)聚类算法将金刚石砂轮表面检测数据划分成金刚石和结合剂两个类别,以数据的质心初始化聚类中心,用迭代的方法分别求出相应的最优聚类中心和隶属度矩阵,通过选取合适的隶属度阈值以及两个聚类中心的欧氏距离阈值来区分金刚石和结合剂,确定磨粒边缘。为验证方法的可行性,对多组数据进行检测,并用模拟的砂轮表面形貌对此方法进行了评定,评定结果与设定值误差不超过2.0%。     

模拟退火与模糊C-均值聚类相结合的图像分割算法

模糊C-均值(FCM)聚类算法是一种结合无监督聚类和模糊集合概念的图像分割技术,比较有效,但存在着受初始聚类中心和隶属度矩阵影响,可能收敛到局部极小的缺点.将模拟退火算法(SA)与模糊C-均值聚类算法相结合,在合理选择冷却进度表的基础上,依据模糊C-均值聚类算法建立模拟退火算法的目标函数,实现了基于模拟退火的模糊C-均值聚类图像分割算法.实验表明,该方法具有搜索全局最优解的能力,因而可得到很好的图像分割结果.     

Automatic Data Clustering Based Mean Best Artificial Bee Colony Algorithm

Fuzzy C-means (FCM) is a clustering method that falls under unsupervised machine learning. The main issues plaguing this clustering algorithm are the number of the unknown clusters within a particular dataset and initialization sensitivity of cluster centres. Artificial Bee Colony (ABC) is a type of swarm algorithm that strives to improve the members’ solution quality as an iterative process with the utilization of particular kinds of randomness. However, ABC has some weaknesses, such as balancing exploration and exploitation. To improve the exploration process within the ABC algorithm, the mean artificial bee colony (MeanABC) by its modified search equation that depends on solutions of mean previous and global best is used. Furthermore, to solve the main issues of FCM, Automatic clustering algorithm was proposed based on the mean artificial bee colony called (AC-MeanABC). It uses the MeanABC capability of balancing between exploration and exploitation and its capacity to explore the positive and negative directions in search space to find the best value of clusters number and centroids value. A few benchmark datasets and a set of natural images were used to evaluate the effectiveness of AC-MeanABC. The experimental findings are encouraging and indicate considerable improvements compared to other state-of-the-art approaches in the same domain.     

A Direct Data-Cluster Analysis Method Based on Neutrosophic Set Implication

Raw data are classified using clustering techniques in a reasonable manner to create disjoint clusters. A lot of clustering algorithms based on specific parameters have been proposed to access a high volume of datasets. This paper focuses on cluster analysis based on neutrosophic set implication, i.e., a k-means algorithm with a threshold-based clustering technique. This algorithm addresses the shortcomings of the k-means clustering algorithm by overcoming the limitations of the threshold-based clustering algorithm. To evaluate the validity of the proposed method, several validity measures and validity indices are applied to the Iris dataset (from the University of California, Irvine, Machine Learning Repository) along with k-means and threshold-based clustering algorithms. The proposed method results in more segregated datasets with compacted clusters, thus achieving higher validity indices. The method also eliminates the limitations of threshold-based clustering algorithm and validates measures and respective indices along with k-means and thresholdbased clustering algorithms.     

Medical Data Clustering and Classification Using TLBO and Machine Learning Algorithms

This study aims to empirically analyze teaching-learning-based optimization (TLBO) and machine learning algorithms using k-means and fuzzy c-means (FCM) algorithms for their individual performance evaluation in terms of clustering and classification. In the first phase, the clustering (k-means and FCM) algorithms were employed independently and the clustering accuracy was evaluated using different computational measures. During the second phase, the non-clustered data obtained from the first phase were preprocessed with TLBO. TLBO was performed using k-means (TLBO-KM) and FCM (TLBO-FCM) (TLBO-KM/FCM) algorithms. The objective function was determined by considering both minimization and maximization criteria. Non-clustered data obtained from the first phase were further utilized and fed as input for threshold optimization. Five benchmark datasets were considered from the University of California, Irvine (UCI) Machine Learning Repository for comparative study and experimentation. These are breast cancer Wisconsin (BCW), Pima Indians Diabetes, Heart-Statlog, Hepatitis, and Cleveland Heart Disease datasets. The combined average accuracy obtained collectively is approximately 99.4% in case of TLBO-KM and 98.6% in case of TLBO-FCM. This approach is also capable of finding the dominating attributes. The findings indicate that TLBO-KM/FCM, considering different computational measures, perform well on the non-clustered data where k-means and FCM, if employed independently, fail to provide significant results. Evaluating different feature sets, the TLBO-KM/FCM and SVM(GS) clearly outperformed all other classifiers in terms of sensitivity, specificity and accuracy. TLBO-KM/FCM attained the highest average sensitivity (98.7%), highest average specificity (98.4%) and highest average accuracy (99.4%) for 10-fold cross validation with different test data.     

Cloud manufacturing resources fuzzy classification based on genetic simulated annealing algorithm

To solve the problem of fuzzy classification of manufacturing resources in a cloud manufacturing environment, a hybrid algorithm based on genetic algorithm (GA), simulated annealing (SA) and fuzzy C-means clustering algorithm (FCM) is proposed. In this hybrid algorithm, classification is based on the processing feature and attributes of the manufacturing resource; the inner and outer layers of the nested loops are solving it, GA obtains the best classification number in the outer layer; the fitness function is constructed by fuzzy clustering algorithm (FCM), carrying out the selection, crossover and mutation operation and SA cooling operation. The final classification results are obtained in the inner layer. Using the hybrid algorithm to solve 45 kinds of manufacturing resources, the optimal classification number is 9 and the corresponding classification results are obtained, proving that the algorithm is effective.     

自适应局部独立分量分析

提出一种自适应局部独立分量分析降噪算法。该算法先将一维时间序列重构到高维相空间,用聚集模糊K均值聚类和聚类评价函数求取高维数据集的聚类个数和聚类中心位置,然后利用K均值聚类寻找局部投影区间,对每个聚类进行独立分量分析并投影到低维空间,将低维空间数据排列并重构成一维时间序列。与使用聚类的局部独立分量分析相比,该算法具有自适应性和稳定性。使用数值仿真试验和齿轮故障信号对该算法进行验证,结果表明该算法对此类信号具有良好的降噪效果。     

Analysis of Semi-Supervised Text Clustering Algorithm on Marine Data

Semi-supervised clustering improves learning performance as long as it uses a small number of labeled samples to assist un-tagged samples for learning. This paper implements and compares unsupervised and semi-supervised clustering analysis of BOAArgo ocean text data. Unsupervised K-Means and Affinity Propagation (AP) are two classical clustering algorithms. The Election-AP algorithm is proposed to handle the final cluster number in AP clustering as it has proved to be difficult to control in a suitable range. Semi-supervised samples thermocline data in the BOA-Argo dataset according to the thermocline standard definition, and use this data for semi-supervised cluster analysis. Several semi-supervised clustering algorithms were chosen for comparison of learning performance: Constrained-K-Means, Seeded-K-Means, SAP (Semi-supervised Affinity Propagation), LSAP (Loose Seed AP) and CSAP (Compact Seed AP). In order to adapt the single label, this paper improves the above algorithms to SCKM (improved Constrained-K-Means), SSKM (improved Seeded-K-Means), and SSAP (improved Semi-supervised Affinity Propagationg) to perform semi-supervised clustering analysis on the data. A DSAP (Double Seed AP) semi-supervised clustering algorithm based on compact seeds is proposed as the experimental data shows that DSAP has a better clustering effect. The unsupervised and semi-supervised clustering results are used to analyze the potential patterns of marine data.     

基于视觉原理的密度聚类算法

在模式识别、图像处理、聚类分析等领域,人的眼睛具有快速有效地组织并发现物体内部结构的自然能力,本文就是在模拟人类视觉系统这一功能的基础上,结合基于密度的聚类方法提出了一种新的聚类算法,该算法具有对初始化参数不敏感、能发现任意形状的聚类及能找到最优聚类等优点。     

近红外透射光谱聚类分析快速鉴别食用油种类

以8种食用油纯油的43个样品为对象,研究了近红外透射光谱结合聚类分析法快速鉴别食用油种类的可行性.采集样品在12 500~4 000 cm-1范围内的傅立叶变换近红外透射光谱,利用光谱模式识别法中的聚类分析法对图谱进行定性分类鉴别.实验证明,光谱经二阶导数预处理后,最短距离法、最长距离法和方差平方和法均可准确无误地将食用油样品分为8类,判别模型对预测集样品的准确率达到100%.研究表明,近红外透射光谱结合聚类分析法可以为快速无损鉴别食用油种类提供一种准确可靠的方法.     

Fast and accurate fuzzy C‐means algorithm for MR brain image segmentation

Fuzzy theory based intelligent techniques are widely preferred for medical applications because of high accuracy. Among the fuzzy based techniques, Fuzzy C‐Means (FCM) algorithm is popular than the other approaches due to the availability of expert knowledge. But, one of the hidden facts is that the computational complexity of the FCM algorithm is significantly high. Since medical applications need to be time effective, suitable modifications must be made in this algorithm for practical feasibility. In this study, necessary changes are included in the FCM approach to make the approach time effective without compromising the segmentation efficiency. An additional data reduction approach is performed in the conventional FCM to minimize the computational complexity and the convergence rate. A comparative analysis with the conventional FCM algorithm and the proposed Fast and Accurate FCM (FAFCM) is also given to show the superior nature of the proposed approach. These techniques are analyzed in terms of segmentation efficiency and convergence rate. Experimental results show promising results for the proposed approach. © 2016 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 26, 188–195, 2016     

Data Mining with Clustering Algorithms to Reduce Packaging Costs: A Case Study

Reducing package‐related cost is essential for various companies and institutions. Different packages are usually designed separately for each and every product, which results in less cost‐effective packaging systems. In this study, a data mining model with three clustering algorithms was developed to modularize a packaging system by reducing the variety of packaging sizes. The three algorithms were k‐means clustering, agglomerative hierarchical clustering and self‐organizing feature map. The package models with similar shapes and sizes were clustered automatically and replaced by one package model with a size that suited them all. The study also analysed the financial effects including the purchasing and inventory costs of the package material and the transportation cost of the packaged products. The case study was carried out at Ericsson to select the best clustering algorithm of the three and to test the effectiveness and applicability of the proposed model. The results show that the packaging system modularized by the agglomerative hierarchical clustering algorithm is more cost‐effective in this case compared with the ones modularized by the other two clustering algorithms and with the one without modularization. Copyright © 2017 John Wiley & Sons, Ltd.     

Genetic-Frog-Leaping Algorithm for Text Document Clustering

In recent years, the volume of information in digital form has increased tremendously owing to the increased popularity of the World Wide Web. As a result, the use of techniques for extracting useful information from large collections of data, and particularly documents, has become more necessary and challenging. Text clustering is such a technique; it consists in dividing a set of text documents into clusters (groups), so that documents within the same cluster are closely related, whereas documents in different clusters are as different as possible. Clustering depends on measuring the content (i.e., words) of a document in terms of relevance. Nevertheless, as documents usually contain a large number of words, some of them may be irrelevant to the topic under consideration or redundant. This can confuse and complicate the clustering process and make it less accurate. Accordingly, feature selection methods have been employed to reduce data dimensionality by selecting the most relevant features. In this study, we developed a text document clustering optimization model using a novel genetic frog-leaping algorithm that efficiently clusters text documents based on selected features. The proposed approach is based on two metaheuristic algorithms: a genetic algorithm (GA) and a shuffled frog-leaping algorithm (SFLA). The GA performs feature selection, and the SFLA performs clustering. To evaluate its effectiveness, the proposed approach was tested on a well-known text document dataset: the “20Newsgroup” dataset from the University of California Irvine Machine Learning Repository. Overall, after multiple experiments were compared and analyzed, it was demonstrated that using the proposed algorithm on the 20Newsgroup dataset greatly facilitated text document clustering, compared with classical K-means clustering. Nevertheless, this improvement requires longer computational time.     

Unsupervised tissue classification of brain MR images for voxel‐based morphometry analysis

In this article, a fully unsupervised method for brain tissue segmentation of T1‐weighted MRI 3D volumes is proposed. The method uses the Fuzzy C‐Means (FCM) clustering algorithm and a Fully Connected Cascade Neural Network (FCCNN) classifier. Traditional manual segmentation methods require neuro‐radiological expertise and significant time while semiautomatic methods depend on parameter's setup and trial‐and‐error methodologies that may lead to high intraoperator/interoperator variability. The proposed method selects the most useful MRI data according to FCM fuzziness values and trains the FCCNN to learn to classify brain’ tissues into White Matter, Gray Matter, and Cerebro‐Spinal Fluid in an unsupervised way. The method has been tested on the IBSR dataset, on the BrainWeb Phantom, on the BrainWeb SBD dataset, and on the real dataset “University of Palermo Policlinico Hospital” (UPPH), Italy. Sensitivity, Specificity, Dice and F‐Factor scores have been calculated on the IBSR and BrainWeb datasets segmented using the proposed method, the FCM algorithm, and two state‐of‐the‐art brain segmentation software packages (FSL and SPM) to prove the effectiveness of the proposed approach. A qualitative evaluation involving a group of five expert radiologists has been performed segmenting the real dataset using the proposed approach and the comparison algorithms. Finally, a usability analysis on the proposed method and reference methods has been carried out from the same group of expert radiologists. The achieved results show that the segmentations of the proposed method are comparable or better than the reference methods with a better usability and degree of acceptance.     

An improved fuzzy clustering method for cellular manufacturing

Fuzzy c-means (FCM) has been successfully adapted to solve the manufacturing cell formation problem. However, when the problem becomes larger and especially if the data is ill structured, the FCM may result in clustering errors, infeasible solutions, and uneven distribution of parts/machines. In this paper, an improved fuzzy clustering algorithm is proposed to overcome the deficiencies of FCM. We tested the effects of algorithm parameters and compared its performance with the original and two popular FCM modifications. Our study shows that the proposed approach outperformed other alternatives. Most of the solutions it obtained are close to and in some cases better than the control solutions.     

基于粒子群优化聚类的汽轮机组振动故障诊断

针对模糊C-均值聚类算法(FCM)容易陷入局部极值和对初始值敏感的不足,提出了一种新的模糊聚类算法(PFCM),新算法利用粒子群优化算法(PSO)全局寻优、快速收敛的特点,代替了FCM算法的基于梯度下降的迭代过程,使算法具有很强的全局搜索能力,很大程度上避免了FCM算法易陷入局部极值的缺陷,同时也降低了FCM算法对初始值的敏感度。将该算法应用于汽轮机组振动故障诊断中,与电厂运行实际故障状态对照,仿真结果表明该算法提高了故障诊断的正确率。为汽轮机振动故障诊断方法的研究提供了一种新的思路。     

A New Time-Aware Collaborative Filtering Intelligent Recommendation System

Aiming at the problem that the traditional collaborative filtering recommendation algorithm does not fully consider the influence of correlation between projects on recommendation accuracy, this paper introduces project attribute fuzzy matrix, measures the project relevance through fuzzy clustering method, and classifies all project attributes. Then, the weight of the project relevance is introduced in the user similarity calculation, so that the nearest neighbor search is more accurate. In the prediction scoring section, considering the change of user interest with time, it is proposed to use the time weighting function to improve the influence of the time effect of the evaluation, so that the newer evaluation information in the system has a relatively large weight. The experimental results show that the improved algorithm improves the recommendation accuracy and improves the recommendation quality.