2009
DOI: 10.1007/978-3-642-01347-8_35
|View full text |Cite
|
Sign up to set email alerts
|

NARFO Algorithm: Mining Non-redundant and Generalized Association Rules Based on Fuzzy Ontologies

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
11
0

Year Published

2012
2012
2019
2019

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 16 publications
(14 citation statements)
references
References 7 publications
0
11
0
Order By: Relevance
“…• minSim, which is the minimum similarity used in the reasoner inferences (Miani et al, 2009); • side, which represents the side of generalization;…”
Section: Main Ideasmentioning
confidence: 99%
See 4 more Smart Citations
“…• minSim, which is the minimum similarity used in the reasoner inferences (Miani et al, 2009); • side, which represents the side of generalization;…”
Section: Main Ideasmentioning
confidence: 99%
“…The similarities are represented in the leaves of ontology. Relations with similarity degree value greater than or equal to the user-provide minSim (Miani et al, 2009) can be show in the rules generated, increasing the semantic enrichment of the same. The generalization is made through a sub-algorithm that uses a methodology of grouping and replacement in the rules.…”
Section: Main Ideasmentioning
confidence: 99%
See 3 more Smart Citations