The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Eighty eight tobacco samples from six provinces in China, of which the contents of rare earth elements (REEs) were determined by microwave digestion-inductively coupled plasma mass spectrometry method. A fuzzy clustering method, fuzzy c-means (FCM), was used for classification of the different kinds of tobaccos based on their contents of REEs. The results show that FCM clustering analysis is a valid...
This paper proposes an improved FCM algorithm aiming at many problems in Fuzzy C Means algorithm, such as being sensitive to initial conditions, usually leading to local minimum results. The new algorithm can obtain global optimal solutions through a new simple and efficient selecting rule of the initial cluster centers, furthermore alternating optimization in terms of a novel separable criterion...
Many existing clustering algorithms use a single prototype to represent a cluster. However sometimes it is very difficult to find a suitable prototype for representing a cluster with an arbitrary shape. One possible solution is to employ multi-prototype instead. In this paper, we propose a minimum spanning tree (MST) based multi-prototype clustering algorithm. It is a split and merge scheme. In the...
This paper proposed a new point symmetry-based ant clustering algorithm which can defect the number of clusters and the proper partitions from data sets when data sets possess the property of symmetry. In the proposed algorithm, a revised ant clustering algorithm is presented which can reduce the running time of standard ant clustering algorithm. Each ant represents a data object. It will decide its...
Given the users relational data of real world, how to get a clear vision of the network structure? A direct way is to identify the primary communities contained in and composed of it. Our goal is to bring forward a pragmatic solution not only discovering such concerned communities but also offering some inner hierarchy information. We propose a novel core vertices based method. Compared with former...
In recent years, extensive researches have been conducted to develop approaches to answer two major challenges for collaborative filtering problems, namely sparsity and scalability. In this paper, we propose a novel collaborative filtering recommendation approach to alleviate these challenges. Our approach firstly converts the user-item ratings matrix to user-class matrix, and hence increases greatly...
Cognitive maps, one of the hot topic in the research of computational intelligence, have been widely used in knowledge representation and decision-making. In mining of cognitive maps on the basis of data resources, outlier data seriously affect the accuracy of cognitive maps. Therefore, this paper, based on the analysis of traditional ones, proposes a new outlier data detection algorithm. The algorithm...
To deal with the problem of too many answers returned from a Web database in response to a user query, this paper proposes a novel categorization approach which takes advantages of the user contextual preferences to construct a navigational tree in order to reduce the information overload. Based on the user original query, we first speculate how much the user cares about each attribute in the specified...
Skyline queries, which retrieve the points that are not dominated by any other points in a given dataset, are well recognized as a powerful tool in multi-criteria decision making. Most of the previous works focus on computing skylines on centralized environments typically with one CPU. In this paper, to scale up skyline computation on large datasets, we propose a load balancing parallel skyline query...
K-dominant skyline query has been proposed as an important operator for multi-criteria decision making, data mining and so on, this technology can reduce the large result sets of skyline query in high dimensional space. In this paper, a new concept was firstly proposed: k-dominant Skyline cube, which consists of all the k-dominant skylines. Although existing algorithms can compute every k-dominant...
Based on the complex network theory, we proposed a clustering algorithm based on content similarity. Firstly, the Chinese documents are represented by the vector-space model, and the content similarity between any two documents is computed by the cosine similarity. Consequently, the network node is defined as a document, and the edge weight is defined as the similarity obtained by the cosine similarity...
Join queries over wireless sensor data streams need to be processed immediately to keep up with the input streams. Many existing algorithms do not solve the problem in context of both limited CPU and memory resources. In this paper, we propose two CML statistic model based approximate sliding window multi-joins algorithms for the system that both CPU and memory is limited, and a maximum subset of...
In order to recover high-level software architecture from existing systems, we define Weighted Directed Class Graph(WDCG) to represent object-oriented software in this paper, which not only reflects static information of lowest level composition of software but also reflects dynamic information of software running. A new hybrid clustering algorithm based on hierarchical clustering and partition clustering...
This paper presents a kernel-based fuzzy c-means algorithm with partition index maximization, called KPIM algorithm. The proposed KPIM algorithm is more robust than the partition index maximization algorithm proposed by Özdemir and Akarum. Experiments show that the advantage of KPIM are robust properties: (1) robust to fuzziness parameter m, (2) robust to outlier, (3) robust to image artifacts; and...
This article presents an approach of knowledge acquisition based on rough fuzzy sets, which combines features of rough sets and fuzzy sets. The continuous attributes in the decision table are fuzzified with fuzzy membership functions. The domain partition is accomplished after establishing fuzzy similarity matrix. Attributes reduction can be obtained using rough-fuzzy dependency, and then decision...
The fuzzy c-means algorithm is a useful technique for clustering real s-dimensional data, but it can not be directly used for partially missing data sets. In this paper, the problem of missing data handling for fuzzy clustering is considered, and a statistical representation of missing attributes is proposed. The approach reduces the statistical analysis of missing attributes to the subsets of the...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.