A Tradeoff Between Accuracy and Speed for K-Means Seed Determination

With a sharp increase in the information volume, analyzing and retrieving this vast data volume is much more essential than ever. One of the main techniques that would be beneficial in this regard is called the Clustering method. Clustering aims to classify objects so that all objects within a cluster have similar features while other objects in different clusters are as distinct as possible. One of the most widely used clustering algorithms with the well and approved performance in different applications is the k-means algorithm. The main problem of the k-means algorithm is its performance which can be directly affected by the selection in the primary clusters. Lack of attention to this crucial issue has consequences such as creating empty clusters and decreasing the convergence time. Besides, the selection of appropriate initial seeds can reduce the cluster’s inconsistency. In this paper, we present a new method to determine the initial seeds of the k-mean algorithm to improve the accuracy and decrease the number of iterations of the algorithm. For this purpose, a new method is proposed considering the average distance between objects to determine the initial seeds. Our method attempts to provide a proper tradeoff between the accuracy and speed of the clustering algorithm. The experimental results showed that our proposed approach outperforms the Chithra with 1.7% and 2.1% in terms of clustering accuracy for Wine and Abalone detection data, respectively. Furthermore, achieved results indicate that comparing with the Reverse Nearest Neighbor (RNN) search approach, the proposed method has a higher convergence speed.     

k-means和QGA优化RBF神经网络模型在导水裂缝带高度预测方面的应用

导水裂缝带高度选取精度的高低直接影响到水体下采煤系统的安全性。为准确预计导水裂缝带高度,本文构建了RBF神经网络基础模型,采用QGA量子遗传算法和K-means算法对基础模型进行优化,获得了K-means和QGA优化的RBF神经网络导水裂缝带高度预计模型。模型经过训练学习和检验,发现模型预计精度满足工程精度需求,且与PSO-RBF神经网络相比,精度更高、收敛速度更快。     

Fingerprint optimization method for the indoor localization system

The accuracy of the indoor localization is influenced directly by the quality of the fingerprint. But the indoor localization algorithms in existence are almost conducted based on the original fingerprint which is not optimized. The k-means is introduced to optimize the fingerprint in this paper. And deleting the collected bad-points through the theory of cluster could make the fingerprint more accurate for the indoor localization algorithm. Compared with the indoor localization systems in existence, the result of experiments shows that the optimized fingerprint can increase the accurate of indoor localization with a higher probability.     

Ensemble cluster pruning via convex-concave programming

Ensemble learning is the process of aggregating the decisions of different learners/models. Fundamentally, the performance of the ensemble relies on the degree of accuracy in individual learner predictions and the degree of diversity among the learners. The trade-off between accuracy and diversity within the ensemble needs to be optimized to provide the best grouping of learners as it relates to their performance. In this optimization theory article, we propose a novel ensemble selection algorithm which, focusing specifically on clustering problems, selects the optimal subset of the ensemble that has both accurate and diverse models. Those ensemble selection algorithms work for a given number of the best learners within the subset prior to their selection. The cardinality of a subset of the ensemble changes the prediction accuracy. The proposed algorithm in this study determines both the number of best learners and also the best ones. We compared our prediction results to recent ensemble clustering selection algorithms by the number of cardinalities and best predictions, finding better and approximated results to the optimum solutions.     

The provably good parallel seeding algorithms for the k-means problem with penalties

As a classic NP-hard problem in machine learning and computational geometry, the k-means problem aims to partition the given points into k sets to minimize the within-cluster sum of squares. The k-means problem with penalties (k-MPWP), as a generalizing problem of the k-means problem, allows a point that can be either clustered or penalized with some positive cost. In this paper, we mainly apply the parallel seeding algorithm to the k-MPWP, and show sufficient analysis to bound the expected solution quality in the case where both the number of iterations and the number of points sampled in each iteration can be given arbitrarily. The approximate guarantee can be obtained as , where is a polynomial function involving the maximal ratio M between the penalties. On one hand, this result can be viewed as a further improvement on the parallel algorithm for k-MPWP given by Li et al., where the number of iterations depends on other factors. On the other hand, our result also generalizes the one solving the k-means problem presented by Bachem et al., because k-MPWP is a variant of the k-means problem. Moreover, we present a numerical experiment to show the effectiveness of the parallel algorithm for k-means with penalties.     

考虑多风电场相关性的场景概率潮流计算及无功优化

针对结合K-means聚类和Copula函数建立场景概率模型时,K-means聚类不能根据风电出力数据分布特点自发确定最佳聚类数这一不足,提出通过基于密度的聚类有效性指标确定最佳聚类数。并以此建立最优场景概率模型,采用改进型回溯搜索算法(BSA)进行无功优化。以澳大利亚的两个相邻风电场实测出力为例,在含多风电场的IEEE30节点系统中对所提方法进行验证,算例结果表明采用所提方法确定的最优场景概率模型能准确描述多风电场输出功率之间的相关性。     

一种基于小字典不对等语料的跨语言词嵌入方法

双语词嵌入通常采用从源语言空间到目标语言空间映射,通过源语言映射嵌入到目标语言空间的最小距离线性变换实现跨语言词嵌入。然而大型的平行语料难以获得,词嵌入的准确率难以提高。针对语料数量不对等、双语语料稀缺情况下的跨语言词嵌入问题,该文提出一种基于小字典不对等语料的跨语言词嵌入方法,首先对单语词向量进行归一化,对小字典词对正交最优线性变换求得梯度下降初始值,然后通过对大型源语言(英语)语料进行聚类,借助小字典找到与每一聚类簇相对应的源语言词,取聚类得到的每一簇词向量均值和源语言与目标语言对应的词向量均值,建立新的双语词向量对应关系,将新建立的双语词向量扩展到小字典中,使得小字典得以泛化和扩展。最后,利用泛化扩展后的字典对跨语言词嵌入映射模型进行梯度下降求得最优值。在英语—意大利语、德语和芬兰语上进行了实验验证,实验结果证明该文方法可以在跨语言词嵌入中减少梯度下降迭代次数,减少训练时间,同时在跨语言词嵌入上表现出较好的正确率。     

Big label: categorizing the Web efficiently and accurately

Searching on the Web has never been an easy task. Even if semantic information is successfully inferred from a user query, how can we benefit from it? The most popular remedy today is to categorize the Web in advance. By gathering similar Web resources into a group, the search performance should increase even though search engines still have little idea about the semantics part. To categorize a set of Web resources according to meta-information associated with them, at first, one has to analyze the relationships between meta-information and Web resources. However, the result will be severely affected by the ambiguous nature of the Web. As a result, the goal of this research is to propose a new labeling method to enhance both the efficiency and accuracy of Web resources categorization.     

基于视觉注意机制的感兴趣区提取方法

以精确获取图像中对象感兴趣区域为目标,提出一种基于视觉注意机制和K均值聚类相结合的感兴趣区提取方法。图像经过视觉特征提取、高斯金字塔多尺度变换后,依据多特征图合并策略生成显著图。采用K均值聚类方法分割图像的候选区域,并结合显著图提取图像感兴趣区。实验结果表明,运用该方法提取的感兴趣区更接近人类的视觉注意过程,并具有一定的抗噪能力。