Public Opinion Hotspot Discovery Algorithm Based on Fuzzy Clustering LDA

2013 ◽  
Vol 433-435 ◽  
pp. 626-629
Author(s):  
Hong Xin Wan ◽  
Yun Peng
Keyword(s):  
Public Opinion ◽  
Key Words ◽  
Fuzzy Clustering ◽  
Fuzzy Set ◽  
High Probability ◽  
Clustering Algorithm ◽  
Precision Data ◽  
Topic Extraction ◽  
Noise Data ◽  
Topic Clustering

The discovery of public opinion hotspot is an important aspect of public opinion research, and because many similarities and relevance exist between hot topics, we propose a hot topic clustering algorithm to find the hotspot in public opinions. Since fuzzy set can handle non-precision data well, the fuzzy algorithm can reduce the influences of the uncertainty of public opinion data. Based on LDA topic extraction we cluster the topical words by fuzzy method, and take the topic probability as word membership to the cluster. It can reduce the noise data and improve the ability of hotspot discovery that aggregate the similar and related topic to one class. The topical key words with high probability in cluster are the hotspot, and singular cluster with few words can be looked as outlier. The algorithm is demonstrated by example analysis in detail.

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 (T, S)-Based Single-Valued Neutrosophic Number Equivalence Matrix and Clustering Method

Mathematics ◽  
2019 ◽  
Vol 7 (1) ◽  
pp. 36 ◽  
Author(s):  
Jiongmei Mo ◽  
Han-Liang Huang
Keyword(s):  
Fuzzy Clustering ◽  
Fuzzy Set ◽  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Dual Pair ◽  
Neutrosophic Set ◽  
The Internet ◽  
Clustering Method ◽  
Comparison Experiment ◽  
Neutrosophic Number

Fuzzy clustering is widely used in business, biology, geography, coding for the internet and more. A single-valued neutrosophic set is a generalized fuzzy set, and its clustering algorithm has attracted more and more attention. An equivalence matrix is a common tool in clustering algorithms. At present, there exist no results constructing a single-valued neutrosophic number equivalence matrix using t-norm and t-conorm. First, the concept of a ( T , S ) -based composition matrix is defined in this paper, where ( T , S ) is a dual pair of triangular modules. Then, a ( T , S ) -based single-valued neutrosophic number equivalence matrix is given. A λ -cutting matrix of single-valued neutrosophic number matrix is also introduced. Moreover, their related properties are studied. Finally, an example and comparison experiment are given to illustrate the effectiveness and superiority of our proposed clustering algorithm.

Combined Probabilistic and Possibilistic Used to a Build Type-2 Fuzzy Clustering Algorithm Model

2013 ◽  
Vol 284-287 ◽  
pp. 3060-3069
Author(s):  
Leehter Yao ◽  
Kuei Sung Weng
Keyword(s):  
Fuzzy Sets ◽  
Membership Function ◽  
Fuzzy Clustering ◽  
Clustering Algorithm ◽  
Fuzzy Clustering Algorithm ◽  
Noise Data ◽  
Membership Value ◽  
Will Force

In a noise environment probabilistic fuzzy clustering will force the noise into one or more clusters, seriously influencing the main dataset structure. We extend Type-1 membership values to Type-2 by assigning a possibilistic-membership function to each Type-1 membership value. The idea in building the Type-2 fuzzy sets is based simply on the fact that, for the same Type-1 membership value, the secondary membership function should make the larger possibility value greater than the smaller possibility value. This paper presents an efficient combined probabilistic and possibilistic method for building Type-2 fuzzy sets. Utilizing this concept we present a Type-2 FCM (T2FCM) that is an extension of the conventional FCM. The experimental results show that the T2FCM is less susceptible to noise than the Type-1 FCM. The T2FCM can ignore the inlier and outlier interrupt. The clustering results show the robustness of the proposed T2FCM because a reasonable amount of noise data does not affect its clustering performance.

Transfer of knowledge in chemical equipment reliability

1989 ◽  
Vol 54 (10) ◽  
pp. 2692-2710 ◽  
Author(s):  
František Babinec ◽  
Mirko Dohnal
Keyword(s):  
Fuzzy Clustering ◽  
Clustering Algorithm ◽  
Chemical Equipment ◽  
Transfer Of Knowledge ◽  
Equipment Reliability ◽  
Fuzzy Clustering Algorithm

The problem of transformation of data on the reliability of chemical equipment obtained in particular conditions to other equipment in other conditions is treated. A fuzzy clustering algorithm is defined for this problem. The method is illustrated on a case study.

Segmentation of corpus callosum based on tensor fuzzy clustering algorithm

2021 ◽  
pp. 1-14
Author(s):  
Yujia Qu ◽  
Yuanjun Wang
Keyword(s):  
Corpus Callosum ◽  
Fuzzy Clustering ◽  
Clustering Algorithm ◽  
Diffusion Tensor ◽  
Region Of Interest ◽  
Midsagittal Plane ◽  
Fuzzy Clustering Algorithm ◽  
Human Connectome Project ◽  
Clustering Center ◽  
Fixed Region

BACKGROUND: The corpus callosum in the midsagittal plane plays a crucial role in the early diagnosis of diseases. When the anisotropy of the diffusion tensor in the midsagittal plane is calculated, the anisotropy of corpus callosum is close to that of the fornix, which leads to blurred boundary of the segmentation region. OBJECTIVE: To apply a fuzzy clustering algorithm combined with new spatial information to achieve accurate segmentation of the corpus callosum in the midsagittal plane in diffusion tensor images. METHODS: In this algorithm, a fixed region of interest is selected from the midsagittal plane, and the anisotropic filtering algorithm based on tensor is implemented by replacing the gradient direction of the structural tensor with an eigenvector, thus filtering the diffusion tensor of region of interest. Then, the iterative clustering center based on K-means clustering is used as the initial clustering center of tensor fuzzy clustering algorithm. Taking filtered diffusion tensor as input data and different metrics as similarity measures, the neighborhood diffusion tensor pixel calculation method of Log Euclidean framework is introduced in the membership function calculation, and tensor fuzzy clustering algorithm is proposed. In this study, MGH35 data from the Human Connectome Project (HCP) are tested and the variance, accuracy and specificity of the experimental results are discussed. RESULTS: Segmentation results of three groups of subjects in MGH35 data are reported. The average segmentation accuracy is 97.34%, and the average specificity is 98.43%. CONCLUSIONS: When segmenting the corpus callosum of diffusion tensor imaging, our method cannot only effective denoise images, but also achieve high accuracy and specificity.

Sign in / Sign up

Export Citation Format

Share Document