2017
DOI: 10.1007/978-3-319-54966-8_6
|View full text |Cite
|
Sign up to set email alerts
|

Application of Tolerance Rough Sets in Structured and Unstructured Text Categorization: A Survey

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
2
2
2

Relationship

1
5

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 18 publications
0
5
0
Order By: Relevance
“…Mathematically, tolerance relations are reflexive and symmetric but are not necessarily transitive, so the classes induced by such relations may have overlapping members. An in-depth survey of application of tolerance rough sets in text categorization can be found in Ramanna et al 26 Rough Sets: Formal Notation Let U be a finite, non-empty universe of objects and let R4U3U denote a binary relation on the universe U. R is called an indiscernibility relation and for rough sets, it has to be an equivalence relation. The pair ðU; RÞ = A constitutes an approximation space.…”
Section: Theorymentioning
confidence: 99%
See 1 more Smart Citation
“…Mathematically, tolerance relations are reflexive and symmetric but are not necessarily transitive, so the classes induced by such relations may have overlapping members. An in-depth survey of application of tolerance rough sets in text categorization can be found in Ramanna et al 26 Rough Sets: Formal Notation Let U be a finite, non-empty universe of objects and let R4U3U denote a binary relation on the universe U. R is called an indiscernibility relation and for rough sets, it has to be an equivalence relation. The pair ðU; RÞ = A constitutes an approximation space.…”
Section: Theorymentioning
confidence: 99%
“…Contexts in zone 4 will not contribute at all, since they suggest no resemblance between np i andnp j . 26 The approximation operators will assess whether these linguistic patterns can be categorized as ''certain,'' ''uncertain,'' ''negative,'' or in ''boundary'' zone of a semantic type.…”
Section: Theorymentioning
confidence: 99%
“…The regions are depicted as squares only for the sake of illustration, but they can be of arbitrary shape. We should note that each granule can contain an arbitrary number of objects or may be empty [51]. The difference between these two regions (also known as the boundary region) contains objects that may belong to more than one category or class or concept.…”
Section: Rough Sets and Tolerance Rough Setsmentioning
confidence: 99%
“…Tolerance relations can be considered as generalizations of equivalence relations [48]. A history of tolerance rough sets from an axiomatic point of view can be found in [51].…”
Section: Uppermentioning
confidence: 99%
“…1 shows the results of applying Genetic Algorithm option in RSES. Table7.2 shows the results of FRNN algorithm using option 1 given in Chapter.…”
mentioning
confidence: 99%