A Fuzzy Algorithm of Customers Evaluation Based on Attributes Reduction

2013 ◽  
Vol 278-280 ◽  
pp. 1287-1291 ◽  
Author(s):  
Hong Xin Wan ◽  
Yun Peng
Keyword(s):  
Fuzzy Set ◽  
Clustering Analysis ◽  
Incomplete Data ◽  
Traditional Method ◽  
Uncertain Data ◽  
Fuzzy Algorithm ◽  
Customer Evaluation ◽  
Evaluation Algorithm ◽  
Clustering Data ◽  
Data Objects

A fuzzy algorithm of customers evaluation based on attributes reduction is presented. The evaluation from the data objects based on key attributes can reduce the data size and algorithm complexity. After Clustering analysis of customers, then the evaluation analysis will process to the clustering data. There are a lot of uncertain data of customer cluster, so the traditional method of classification and evaluation to the incomplete data is very difficult. Superposition evaluation algorithm based on fuzzy set can improve the reliability and accuracy of e-commerce customer evaluation. Evaluation of the e-commerce customer also can improve efficiency, service quality and profitability of e-commerce businesses.

A Fuzzy Clustering Algorithm of Web Customers Based on Attributes Reduction

2014 ◽  
Vol 989-994 ◽  
pp. 1775-1778
Author(s):  
Hong Xin Wan ◽  
Yun Peng
Keyword(s):  
Rough Set ◽  
Fuzzy Set ◽  
Incomplete Data ◽  
Traditional Method ◽  
Clustering Algorithm ◽  
Uncertain Data ◽  
Attribute Reduction ◽  
Fuzzy Clustering Algorithm ◽  
Evaluation Algorithm ◽  
Data Objects

The evaluation algorithm is based on the attributes of data objects. There is a certain correlation between attributes, and attributes are divided into key attributes and secondary attributes. This paper proposes an algorithm of attribute reduction based on rough set and the clustering algorithm based on fuzzy set. The algorithm of attributes reduction based on rough set is described in detail first. There are a lot of uncertain data of customer clustering, so traditional method of classification to the incomplete data will be very complex. Clustering algorithm based on fuzzy set can improve the reliability and accuracy of web customers.

scholarly journals A General Framework for Mixed and Incomplete Data Clustering Based on Swarm Intelligence Algorithms

Mathematics ◽  
2021 ◽  
Vol 9 (7) ◽  
pp. 786
Author(s):  
Yenny Villuendas-Rey ◽  
Eley Barroso-Cubas ◽  
Oscar Camacho-Nieto ◽  
Cornelio Yáñez-Márquez
Keyword(s):  
Swarm Intelligence ◽  
Data Clustering ◽  
Incomplete Data ◽  
Missing Values ◽  
Clustering Algorithms ◽  
Bat Algorithm ◽  
Hybrid Features ◽  
Bee Colony ◽  
Learning Tasks ◽  
Clustering Data

Swarm intelligence has appeared as an active field for solving numerous machine-learning tasks. In this paper, we address the problem of clustering data with missing values, where the patterns are described by mixed (or hybrid) features. We introduce a generic modification to three swarm intelligence algorithms (Artificial Bee Colony, Firefly Algorithm, and Novel Bat Algorithm). We experimentally obtain the adequate values of the parameters for these three modified algorithms, with the purpose of applying them in the clustering task. We also provide an unbiased comparison among several metaheuristics based clustering algorithms, concluding that the clusters obtained by our proposals are highly representative of the “natural structure” of data.

Fuzzy Set Based Clustering Algorithm of Web Text

2014 ◽  
Vol 678 ◽  
pp. 19-22
Author(s):  
Hong Xin Wan ◽  
Yun Peng
Keyword(s):  
Key Words ◽  
Fuzzy Set ◽  
Clustering Algorithm ◽  
Text Clustering ◽  
Classification Methods ◽  
Comparative Experiment ◽  
Fuzzy Algorithm ◽  
Pattern Clustering ◽  
The Web ◽  
Computing Accuracy

Web text exists non-certain and non-structure contents ,and it is difficult to cluster the text by normal classification methods. We propose a web text clustering algorithm based on fuzzy set to increase the computing accuracy with the web text. After abstracting the key words of the text, we can look it as attributes and design the fuzzy algorithm to decide the membership of the words. The algorithm can improve the algorithm complexity of time and space, increase the robustness comparing to the normal algorithm. To test the accuracy and efficiency of the algorithm, we take the comparative experiment between pattern clustering and our algorithm. The experiment shows that our method has a better result.

scholarly journals K-Nearest Neighbor Intervals Based AP Clustering Algorithm for Large Incomplete Data

2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Cheng Lu ◽  
Shiji Song ◽  
Cheng Wu
Keyword(s):  
Clustering Analysis ◽  
Incomplete Data ◽  
Clustering Algorithm ◽  
Nearest Neighbor ◽  
Interval Data ◽  
Similarity Function ◽  
K Nearest Neighbor ◽  
Partial Data ◽  
Missing Attributes ◽  
Ap Clustering

The Affinity Propagation (AP) algorithm is an effective algorithm for clustering analysis, but it can not be directly applicable to the case of incomplete data. In view of the prevalence of missing data and the uncertainty of missing attributes, we put forward a modified AP clustering algorithm based onK-nearest neighbor intervals (KNNI) for incomplete data. Based on an Improved Partial Data Strategy, the proposed algorithm estimates the KNNI representation of missing attributes by using the attribute distribution information of the available data. The similarity function can be changed by dealing with the interval data. Then the improved AP algorithm can be applicable to the case of incomplete data. Experiments on several UCI datasets show that the proposed algorithm achieves impressive clustering results.

scholarly journals Consistency Fuzzy Sets and a Cosine Similarity Measure in Fuzzy Multiset Setting and Application to Medical Diagnosis

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Ezgi Türkarslan ◽  
Jun Ye ◽  
Mehmet Ünver ◽  
Murat Olgun
Keyword(s):  
Correlation Coefficient ◽  
Similarity Measure ◽  
Fuzzy Set ◽  
Medical Diagnosis ◽  
Uncertain Data ◽  
Cosine Similarity ◽  
Comparison Analysis ◽  
Average Value ◽  
Truth Function ◽  
Cosine Similarity Measure

The main purpose of this study is to construct a base for a new fuzzy set concept that is called consistency fuzzy set (CFS) which expresses the multidimensional uncertain data quite successfully. Our motive is to reduce the complexity and difficulty caused by the information contained in the truth sequence in a fuzzy multiset (FMS) and to present the data of the truth sequence in a more understandable and compact manner. Therefore, this paper introduces the concept of CFS that is characterized with a truth function defined on a universal set 0,1 2 . The first component of the truth pair of a CFS is the average value of the truth sequence of a FMS and the second component is the consistency degree, that is, the fuzzy complement of the standard deviation of the truth sequence of the same FMS. The main contribution of a CFS is the reflection of both the level of the average of the data that can be expressed with the different sequence lengths and the degree of the reasonable information in data via consistency degree. To develop this new concept, this paper also presents a correlation coefficient and a cosine similarity measure between CFSs. Furthermore, the proposed correlation coefficient and cosine similarity measure are applied to a multiperiod medical diagnosis problem. Finally, a comparison analysis is given between the obtained results and the existing results in literature to show the efficiency and rationality of the proposed correlation coefficient and cosine similarity measure.

scholarly journals Experiments on Clustering Algorithms for Mixed and Incomplete Data

2019 ◽  
Vol 9 (2) ◽  
pp. 4778-4784
Keyword(s):  
Machine Learning ◽  
Experimental Study ◽  
Incomplete Data ◽  
Clustering Algorithms ◽  
Cluster Validation ◽  
Clustering Data

Clustering mixed and incomplete data is a goal of frequent approaches in the last years because its common apparition in soft sciences problems. However, there is a lack of studies evaluating the performance of clustering algorithms for such kind of data. In this paper we present an experimental study about performance of seven clustering algorithms which used one of these techniques: partition, hierarchal or metaheuristic. All the methods ran over 15 databases from UCI Machine Learning Repository, having mixed and incomplete data descriptions. In external cluster validation using the indices Entropy and V-Measure, the algorithms that use the last technique showed the best results. Thus, we recommend metaheuristic based clustering algorithms for clustering data having mixed and incomplete descriptions.

Data Discovery Approaches for Vague Spatial Data

Data Mining ◽  
2013 ◽  
pp. 50-65
Author(s):  
Frederick E. Petry
Keyword(s):  
Data Mining ◽  
Fuzzy Sets ◽  
Association Rules ◽  
Rough Set ◽  
Fuzzy Set ◽  
Spatial Data ◽  
Spatial Databases ◽  
Uncertain Data ◽  
Rule Extraction ◽  
Data Discovery

This chapter focuses on the application of the discovery of association rules in approaches vague spatial databases. The background of data mining and uncertainty representations using rough set and fuzzy set techniques is provided. The extensions of association rule extraction for uncertain data as represented by rough and fuzzy sets is described. Finally, an example of rule extraction for both types of uncertainty representations is given.

On Fuzzy Non-Metric Model for Data with Tolerance and its Application to Incomplete Data Clustering

2016 ◽  
Vol 20 (4) ◽  
pp. 571-579 ◽  
Author(s):  
Yasunori Endo ◽  
◽  
Tomoyuki Suzuki ◽  
Naohiko Kinoshita ◽  
Yukihiro Hamasuna ◽  
...  
Keyword(s):  
Data Clustering ◽  
Incomplete Data ◽  
Clustering Algorithm ◽  
Uncertain Data ◽  
Data Sets ◽  
Membership Degree ◽  
Clustering Methods ◽  
Clustering Method ◽  
Numerical Examples ◽  
Metric Model

The fuzzy non-metric model (FNM) is a representative non-hierarchical clustering method, which is very useful because the belongingness or the membership degree of each datum to each cluster can be calculated directly from the dissimilarities between data and the cluster centers are not used. However, the original FNM cannot handle data with uncertainty. In this study, we refer to the data with uncertainty as “uncertain data,” e.g., incomplete data or data that have errors. Previously, a methods was proposed based on the concept of a tolerance vector for handling uncertain data and some clustering methods were constructed according to this concept, e.g. fuzzyc-means for data with tolerance. These methods can handle uncertain data in the framework of optimization. Thus, in the present study, we apply the concept to FNM. First, we propose a new clustering algorithm based on FNM using the concept of tolerance, which we refer to as the fuzzy non-metric model for data with tolerance. Second, we show that the proposed algorithm can handle incomplete data sets. Third, we verify the effectiveness of the proposed algorithm based on comparisons with conventional methods for incomplete data sets in some numerical examples.

scholarly journals A Systematic Algorithm for Data Cluster Using Map-Reduce Approach

2019 ◽  
pp. 564-569
Author(s):  
Kechika. S ◽  
Sapthika. B ◽  
Keerthana. B ◽  
Abinaya. S ◽  
Abdulfaiz. A
Keyword(s):  
Feature Selection ◽  
Map Reduce ◽  
Features Selection ◽  
Selection Algorithm ◽  
Feature Selection Algorithm ◽  
Main Concept ◽  
Selection Approach ◽  
Clustering Data ◽  
Data Objects ◽  
Time Required

We have been studying the problem clustering data objects as we have implemented a new algorithm called algorithm of clustering data using map reduce approach. In cluster, main part is feature selection which involves in recognition of set of features of a subset, since feature selection is considered as a important process. They also produces the approximate and according requests with the original set of features used in this type of approach. The main concept beyond this paper is to give the outcome of the clustering features. This paper which also gives the knowledge about cluster and it's own process. To processing of large datasets the nature of clustering where some more concepts are more helpful and important in a clustering process. In a clustering methodology where more concepts are very useful. The feature selection algorithm which affects, the entire process of clustering is the map-reduce concept. since, feature selection or extraction which is also used in map-reduce approach. The most desirable component is time complexity where efficiency concerns in this criterion. Here time required to find the effective features, where features of quality subsets is equal to effectiveness. The complexity to find based on this criteria based map-reduce features selection approach, which is proposed and evaluated in this paper.

scholarly journals Analysis of Some Algorithms for Clustering Data Objects

2014 ◽  
Vol 4 (1) ◽  
pp. 99-105
Author(s):  
Mohamed Nour Elsayed ◽  
Monzer Mohamed Qasem
Keyword(s):  
Clustering Data ◽  
Data Objects
Sign in / Sign up

Export Citation Format

Share Document