An overlapping cluster algorithm to provide non-exhaustive clustering

The partitioning clustering is a technique to classify n objects into k disjoint clusters, and has been developed for years and widely used in many applications. In this paper, a new overlapping cluster algorithm is defined. It differs from traditional clustering algorithms in three respects. First, the new clustering is overlapping, because clusters are allowed to overlap with one another. Second, the clustering is non-exhaustive, because an object is permitted to belong to no cluster. Third, the goals considered in this research are the maximization of the average number of objects contained in a cluster and the maximization of the distances among cluster centers, while the goals in previous research are the maximization of the similarities of objects in the same clusters and the minimization of the similarities of objects in different clusters. Furthermore, the new clustering is also different from the traditional fuzzy clustering, because the object–cluster relationship in the new clustering is represented by a crisp value rather than that represented by using a fuzzy membership degree. Accordingly, a new overlapping partitioning cluster (OPC) algorithm is proposed to provide overlapping and non-exhaustive clustering of objects. Finally, several simulation and real world data sets are used to evaluate the effectiveness and the efficiency of the OPC algorithm, and the outcomes indicate that the algorithm can generate satisfactory clustering results.     

Some robust objectives of FCM for data analyzing

There are many data clustering techniques available to extract meaningful information from real world data, but the obtained clustering results of the available techniques, running time for the performance of clustering techniques in clustering real world data are highly important. This work is strongly felt that fuzzy clustering technique is suitable one to find meaningful information and appropriate groups into real world datasets. In fuzzy clustering the objective function controls the groups or clusters and computation parts of clustering. Hence researchers in fuzzy clustering algorithm aim is to minimize the objective function that usually has number of computation parts, like calculation of cluster prototypes, degree of membership for objects, computation part for updating and stopping algorithms. This paper introduces some new effective fuzzy objective functions with effective fuzzy parameters that can help to minimize the running time and to obtain strong meaningful information or clusters into the real world datasets. Further this paper tries to introduce new way for predicting membership, centres by minimizing the proposed new fuzzy objective functions. And experimental results of proposed algorithms are given to illustrate the effectiveness of proposed methods.     

The Cluster Algorithms for Solving Problems with Asymmetric Proximity Measures

Cluster analysis is used in various scientific and applied fields and is a topical subject of research. In contrast to the existing methods, the algorithms offered in this paper are intended for clustering objects described by feature vectors in a space in which the symmetry axiom is not satisfied. In this case, the clustering problem is solved using an asymmetric proximity measure. The essence of the first of the proposed clustering algorithms consists in sequential generation of clusters with simultaneous transfer of the objects clustered from previously created clusters into a current cluster if this reduces the quality criterion. In comparison with the existing algorithms of non-hierarchical clustering, such an approach to cluster generation makes it possible to reduce the computational costs. The second algorithmis a modified version of the first one andmakes it possible to reassign the main objects of clusters to further decrease the value of the proposed quality criterion.     

The bi-objective fuzzy c-means cluster analysis for TSK fuzzy system identification

For conventional fuzzy clustering-based approaches to fuzzy system identification, a fuzzy function is used for cluster formation and another fuzzy function is used for cluster validation to determine the number and location of the clusters which define IF parts of the rule base. However, the different fuzzy functions used for cluster formation and validation may not indicate the same best number and location of the clusters. This potential disparity motivates us to propose a new fuzzy clustering-based approach to fuzzy system identification based on the bi-objective fuzzy c-means (BOFCM) cluster analysis. In this approach, we use the BOFCM function for both cluster formation and validation to simultaneously determine the number and location of the clusters which we hope can efficiently and effectively define IF parts of the rule base. The proposed approach is validated by applying it to the truck backer-upper problem with an obstacle in the center of the field.     

Genetic algorithm-tuned entropy-based fuzzy C-means algorithm for obtaining distinct and compact clusters

A modified approach had been developed in this study by combining two well-known algorithms of clustering, namely fuzzy c-means algorithm and entropy-based algorithm. Fuzzy c-means algorithm is one of the most popular algorithms for fuzzy clustering. It could yield compact clusters but might not be able to generate distinct clusters. On the other hand, entropy-based algorithm could obtain distinct clusters, which might not be compact. However, the clusters need to be both distinct as well as compact. The present paper proposes a modified approach of clustering by combining the above two algorithms. A genetic algorithm was utilized for tuning of all three clustering algorithms separately. The proposed approach was found to yield both distinct as well as compact clusters on two data sets.     

Ranking generalized fuzzy numbers in fuzzy decision making based on the left and right transfer coefficients and areas

Although a number of recent studies have proposed ranking fuzzy numbers based on the deviation degree, most of them have exhibited several shortcomings associated with non-discriminative and counter-intuitive problems. In fact, none of the existing deviation degree methods has guaranteed consistencies between the ranking of fuzzy numbers and that of their images under all situations. They have also ignored decision maker’s attitude toward risk, which significantly influences final ranking result. To overcome the above-mentioned drawbacks, this study proposes a new approach for ranking fuzzy numbers that ensures full consideration for all information of fuzzy numbers. Accordingly, an overall ranking index is obtained by the integration of the information from the left and the right (LR) areas between fuzzy numbers, the centroid points of fuzzy numbers and the decision maker’s attitude toward risk. This new method is efficient for evaluating generalized fuzzy numbers and distinguishing symmetric fuzzy numbers. It also overcomes the shortcomings of the existing approaches based on deviation degree. Several numerical examples are provided to illustrate the superiority of the proposed approach. Lastly, a new fuzzy MCDM approach for generalized fuzzy numbers is proposed based on the proposed ranking approach and the concept of generalized fuzzy numbers. The proposed fuzzy MCDM approach does not require the normalization process and thus avoids the loss of information results from transforming generalized fuzzy numbers to normal form.     

Fuzzy clustering using multiple Gaussian kernels with optimized-parameters

In this paper, we propose a new kernel-based fuzzy clustering algorithm which tries to find the best clustering results using optimal parameters of each kernel in each cluster. It is known that data with nonlinear relationships can be separated using one of the kernel-based fuzzy clustering methods. Two common fuzzy clustering approaches are: clustering with a single kernel and clustering with multiple kernels. While clustering with a single kernel doesn’t work well with “multiple-density” clusters, multiple kernel-based fuzzy clustering tries to find an optimal linear weighted combination of kernels with initial fixed (not necessarily the best) parameters. Our algorithm is an extension of the single kernel-based fuzzy c-means and the multiple kernel-based fuzzy clustering algorithms. In this algorithm, there is no need to give “good” parameters of each kernel and no need to give an initial “good” number of kernels. Every cluster will be characterized by a Gaussian kernel with optimal parameters. In order to show its effective clustering performance, we have compared it to other similar clustering algorithms using different databases and different clustering validity measures.     

基于AFS逻辑的模糊聚类分析

应用 AFS结构[8] 和 EI代数 [8] 给出一个新的模糊聚类分析方法。它和人类根据某些模糊特征对一些对象进行聚类分析的过程类似。并通过例子说明该方法分类的结果与用直觉分类的结果相似。     

Long-range predictive adaptive fuzzy relational control

A class of long-range predictive adaptive fuzzy relational controllers is presented. The plant behavior is described over an extended time horizon by a fuzzy relational model which is identified based on input-output closed-loop observations of the plant variables. In this class of adaptive controllers the control law attempts to minimize a quadratic cost over an extended control horizon. When used with linear models, this approach has revealed a significant potential for overcoming the limitations of one-step ahead schemes, such as the stabilization of non-minimum phase plants. Here, a uniform framework is adopted for implementing both the fuzzy model and the fuzzy controller, namely distributed fuzzy relational structures gaining from their massive parallel processing features and from the learning capabilities typical of the connectivist approaches. Issues such as maintenance during the adaptation process of the meaning of linguistic terms used at both fuzzy systems interfaces are addressed, namely by introducing a new design methodology for on-line fuzzy systems interface adaptation. The examples presented reinforce the claim of the usefulness of this new approach.     

Ranking fuzzy quantities based on the angle of the reference functions

Ordering fuzzy quantities and their comparison play a key tool in many applied models in the world and in particular decision-making procedures. However a huge number of researches is attracted to this filed but until now there is any unique accepted method to rank the fuzzy quantities. In fact, each proposed method may has some shortcoming. So we are going to present a novel method based on the angle of the reference functions to cover a wide range of fuzzy quantities by over coming the draw backs of some existing methods. In the mentioned firstly, the angle between the left and right membership functions (the reference functions) of every fuzzy set is called Angle of Fuzzy Set (AFS), and then in order to extend ranking of two fuzzy sets the angle of fuzzy sets and α-cuts is used. The method is illustrated by some numerical examples and in particular the results of ranking by the proposed method and some common and existing methods for ranking fuzzy sets is compared to verify the advantage of the new approach. In particular, based on the results of comparison of our method with well known methods which are exist in the literature, we will see that against of most existing ranking approaches, our proposed approach can rank fuzzy numbers that have the same mode and symmetric spreads. In fact, the proposed method in this paper can effectively rank symmetric fuzzy numbers as well as the effective methods which are appeared in the literature. Moreover, unlike of most existing ranking approaches, our proposed approach can rank non-normal fuzzy sets. Finally, we emphasize that the concept of fuzzy ordering is one of key role in establishing the numerical algorithms in operations research such as fuzzy primal simplex algorithms, fuzzy dual simplex algorithms and as well as discussed in the works of Ebrahimnejad and Nasseri and coworkers , , , , ,  and .     

Cluster analysis based on fuzzy equivalence relation

In this paper, a cluster analysis method based on fuzzy equivalence relation is proposed. At first, the distance formula between two trapezoidal fuzzy numbers is used to aggregate subjects' linguistic assessments about attributes ratings to obtain the compatibility relation. Then a fuzzy equivalence relation based on the fuzzy compatibility relation can be constructed. Finally, using a cluster validity index to determine the best number of clusters and taking suitable λ-cut value, the clustering analysis can be effectively implemented. By utilizing this clustering analysis, the subjects' fuzzy assessments with various rating attitudes can be taken into account in the aggregation process to assure more convincing and accurate cluster analysis.     

Data Clustering Based on Maximization of Outlier Factor

There exist many data clustering algorithms, but they can not adequately handle the number of clusters or cluster shapes. Their performance mainly depends on a choice of algorithm parameters. Our approach to data clustering and algorithm does not require the parameter choice; it can be treated as a natural adaptation to the existing structure of distances between data points. The outlier factor introduced by the author specifies a degree of being an outlier for each data point. The outlier factor notion is based on the difference between the frequency distribution of interpoint distances in a given dataset and the corresponding distribution of uniformly distributed points. Then data clusters can be determined by maximizing the outlier factor function. The data points in dataset are divided into clusters according to the attractor regions of local optima. An experimental evaluation of the proposed algorithm shows that the proposed method can identify complex cluster shapes. Key advantages of the approach are: good clustering properties for datasets with comparatively large amount of noise (an additional data points), and an absence of important parameters which adequate choice determines the quality of results.     

On principle axis based line symmetry clustering techniques

In this paper, at first a new line symmetry (LS) based distance is proposed which calculates the amount of symmetry of a point with respect to the first principal axis of a data set. The proposed distance uses a recently developed point symmetry (PS) based distance in its computation. Kd-tree based nearest neighbor search is used to reduce the complexity of computing the closest symmetric point. Thereafter an evolutionary clustering technique is described that uses this new principal axis based LS distance for assignment of points to different clusters. The proposed GA with line symmetry distance based (GALS) clustering technique is able to detect any type of clusters, irrespective of their geometrical shape, size or convexity as long as they possess the characteristics of LS. GALS is compared with the existing genetic algorithm based K-means clustering technique, GAK-means, existing genetic algorithm with PS based clustering technique, GAPS, spectral clustering technique, and average linkage clustering technique. Five artificially generated data sets having different characteristics and seven real-life data sets are used to demonstrate the superiority of the proposed GALS clustering technique. In a part of experiment, utility of the proposed genetic LS distance based clustering technique is demonstrated for segmenting the satellite image of the part of the city of Kolkata. The proposed technique is able to distinguish different landcover types in the image. In the last part of the paper genetic algorithm is used to search for the suitable line of symmetry of each cluster.     

Similarity,inclusion and entropy measures between type-2 fuzzy sets based on the Sugeno integral

Similarity measures of type-2 fuzzy sets are used to indicate the similarity degree between type-2 fuzzy sets. Inclusion measures for type-2 fuzzy sets are the degrees to which a type-2 fuzzy set is a subset of another type-2 fuzzy set. The entropy of type-2 fuzzy sets is the measure of fuzziness between type-2 fuzzy sets. Although several similarity, inclusion and entropy measures for type-2 fuzzy sets have been proposed in the literatures, no one has considered the use of the Sugeno integral to define those for type-2 fuzzy sets. In this paper, new similarity, inclusion and entropy measure formulas between type-2 fuzzy sets based on the Sugeno integral are proposed. Several examples are used to present the calculation and to compare these proposed measures with several existing methods for type-2 fuzzy sets. Numerical results show that the proposed measures are more reasonable than existing measures. On the other hand, measuring the similarity between type-2 fuzzy sets is important in clustering for type-2 fuzzy data. We finally use the proposed similarity measure with a robust clustering method for clustering the patterns of type-2 fuzzy sets.     

基于毕达哥拉斯犹豫模糊距离测度的灰关联双向投影决策法

为解决多属性决策单方向偏差难题所提出的灰关联投影法尚存在适用性差的技术不足。为此,在借鉴双向投影技术要点的基础上联合新型灰关联系数,并引入毕达哥拉斯犹豫模糊集的表达优势,提出基于毕达哥拉斯犹豫模糊距离测度的灰关联双向投影决策方法。新方法能够有效解决毕达哥拉斯犹豫模糊多属性决策问题,具有较高的分辨度。通过算例应用分析,直接验证了毕达哥拉斯犹豫模糊灰关联双向投影方法的实用性,间接验证了毕达哥拉斯犹豫模糊距离测度和灰关联双向投影法的有效性。     

基于双向改进余弦相似度的话题发现算法

话题发现是网络社交平台上进行热点话题预测的一个重要研究问题。针对已有话题发现算法大多基于传统余弦相似度衡量文本数据间的相似性,无法识别各维度取值成比例变化时数据对象间的差异,文本数据相似度计算结果不准确,影响话题发现正确率的问题,提出基于双向改进余弦相似度的话题发现算法(TABOC),首先从方向和取值两个角度改进余弦相似度,提出双向改进余弦相似度,能够区分各维度取值成比例变化的数据对象,保留传统余弦相似度在方向判别上的优势,提高衡量文本相似度的准确性;进一步定义集合的双向改进余弦特征向量和双向改进余弦特征向量的加法等相关定义定理,舍弃无关信息,直接计算新合并集合的特征向量,减小话题发现过程中的时间和空间消耗;还结合增量聚类框架,高效处理新增数据。采用百度贴吧数据进行实验表明,TABOC算法进行话题发现是有效可行的,算法正确率和时间效率总体上优于其他对比算法。     

Towards optimal workload-aware XML to relational schema mapping

Storing XML documents in relational databases has drawn much attention in recent years because it can leverage existing investments in relational database technologies. Different algorithms have been proposed to map XML DTD/Schema to relational schema in order to store XML data in relational databases. However, most work defines mapping rules based on heuristics without considering application characteristics, hence fails to produce efficient relational schema for various applications. In this paper, we propose a workload-aware approach to generate relational schema from XML data and user specified workload. Our approach adopts the genetic algorithm to find optimal mappings. An elegant encoding method and related operations are proposed to manipulate mappings using bit strings. Various techniques for optimization can be applied to the XML to relational mapping problem based on this representation. We implemented the proposed algorithm and our experiment results showed that our algorithm was more robust and produced better mappings than existing work.     

Minimizing deviations from the group mean: A new linear programming approach for the two-group classification problem

This paper proposes a new linear programming approach to solve the two-group classification problem in discriminant analysis. This new approach is based on an idea from cluster analysis that objects within the same group should be more similar than objects between groups. Consequently, it is desirable for the classification score of an object to be nearer to its mean classification score, but further from the mean classification score of the other group. This objective is accomplished by minimizing the total deviation of the classification scores of the objects from their group mean scores in a linear programming approach. When applied to an actual managerial problem and simulated data, the proposed linear programming approach performs well both in groups separation and group-membership predictions of new objects. Moreover, this new approach has an advantage of obtaining more stable classification function across different samples than most of the existing linear programming approaches.     

An adaptive neuro‐fuzzy inference system for islanding detection in wind turbine as distributed generation

This article proposes a new integrated diagnostic system for islanding detection by means of a neuro‐fuzzy approach. Islanding detection and prevention is a mandatory requirement for grid‐connected distributed generation (DG) systems. Several methods based on passive and active detection scheme have been proposed. Although passive schemes have a large non‐detection zone (NDZ), concern has been raised on active method due to its degrading power‐quality effect. Reliably detecting this condition is regarded by many as an ongoing challenge as existing methods are not entirely satisfactory. The main emphasis of the proposed scheme is to reduce the NDZ to as close as possible and to keep the output power quality unchanged. In addition, this technique can also overcome the problem of setting the detection thresholds inherent in the existing techniques. In this study, we propose to use a hybrid intelligent system called ANFIS (the adaptive neuro‐fuzzy inference system) for islanding detection. This approach utilizes rate of change of frequency (ROCOF) at the target DG location and used as the input sets for a neuro‐fuzzy inference system for intelligent islanding detection. This approach utilizes the ANFIS as a machine learning technology and fuzzy clustering for processing and analyzing the large data sets provided from network simulations using MATLAB software. To validate the feasibility of this approach, the method has been validated through several conditions and different loading, switching operation, and network conditions. The proposed algorithm is compared with the widely used ROCOF relays and found working effectively in the situations where ROCOF fails. Simulation studies showed that the ANFIS‐based algorithm detects islanding situation accurate than other islanding detection algorithms. © 2014 Wiley Periodicals, Inc. Complexity 21: 10–20, 2015     

Mixed fuzzy inter-cluster separation clustering algorithm

Based on inter-cluster separation clustering (ICSC) fuzzy inter-cluster separation clustering (FICSC) deals with all the distances between the cluster centers, maximizes these distances and obtains the better performances of clustering. However, FICSC is sensitive to noises the same as fuzzy c-means (FCM) clustering. Possibilistic type of FICSC is proposed to combine FICSC and possibilistic c-means (PCM) clustering. Mixed fuzzy inter-cluster separation clustering (MFICSC) is presented to extend possibilistic type of FICSC because possibilistic type of FICSC is sensitive to initial cluster centers and always generates coincident clusters. MFICSC can produce both fuzzy membership values and typicality values simultaneously. MFICSC shows good performances in dealing with noisy data and overcoming the problem of coincident clusters. The experimental results with data sets show that our proposed MFICSC holds better clustering accuracy, little clustering time and the exact cluster centers.