2015
DOI: 10.1016/j.datak.2015.04.008
|View full text |Cite
|
Sign up to set email alerts
|

A fuzzy document clustering approach based on domain-specified ontology

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 23 publications
(7 citation statements)
references
References 27 publications
(28 reference statements)
0
7
0
Order By: Relevance
“…In this paper, through the calculation and adjustment, we take c = 0.1, which can make the calculation results in the interval [0, 1] to disperse better. rij=1c0.25em0.25emd(),xixj where d ( x i , x j ) is Euclidean distance, d(),xixj=true∑()xixj2. Step 3Solving the transitive closure. The transitive closure of a fuzzy similarity relation R , also known as a fuzzy equivalence relation, is defined as the relation that is transitive, contains R , and has the smallest possible membership grades (Yue et al ., ). In this study, we solved the transitive closure using quadratic programming.…”
Section: Framework and Methodologymentioning
confidence: 99%
See 1 more Smart Citation
“…In this paper, through the calculation and adjustment, we take c = 0.1, which can make the calculation results in the interval [0, 1] to disperse better. rij=1c0.25em0.25emd(),xixj where d ( x i , x j ) is Euclidean distance, d(),xixj=true∑()xixj2. Step 3Solving the transitive closure. The transitive closure of a fuzzy similarity relation R , also known as a fuzzy equivalence relation, is defined as the relation that is transitive, contains R , and has the smallest possible membership grades (Yue et al ., ). In this study, we solved the transitive closure using quadratic programming.…”
Section: Framework and Methodologymentioning
confidence: 99%
“…Step 3 Solving the transitive closure. The transitive closure of a fuzzy similarity relation R, also known as a fuzzy equivalence relation, is defined as the relation that is transitive, contains R, and has the smallest possible membership grades (Yue et al, 2015). In this study, we solved the transitive closure using quadratic programming.…”
Section: Main Step Of Fuzzy Clustering Analysis According Tomentioning
confidence: 99%
“…Hierarchical agglomerative clustering can be computationally expensive to use for large datasets. In [15] also proposed the use of semantic clustering to determine similar text documents. The text corpus is extracted and pre-processed.…”
Section: Literature Reviewmentioning
confidence: 99%
“…As researchers find that the relations between words contribute to understanding the meaning of text, they construct a semantic network in terms of concepts, events, and their relations. Yue et al [15] constructed a domain-specific ontology to describe the hazards related to dairy products and translated the term-document vectors (namely, feature vectors of text) into a concept space. Wei et al [16] exploited an ontology hierarchical structure for word sense disambiguation to assess similarity of words.…”
Section: Feature Extractionmentioning
confidence: 99%