2015
DOI: 10.4028/www.scientific.net/amm.764-765.910
|View full text |Cite
|
Sign up to set email alerts
|

FCA-Based Data Analysis for Discovering Association Rules in Social Network Service

Abstract: Recently, Formal Concept Analysis (FCA) have been widely used for various purposes in many different domains such as data mining, machine learning, knowledge management and so on. In this paper, we introduce FCA as the basis for a practical and well founded methodological approach for data analysis which identifies conceptual structures among data sets. As well as, we propose a FCA-based data analysis for discovering association rules by using polarity from social contents. Additionally, we show the experiment… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 8 publications
0
3
0
Order By: Relevance
“…First, the procedure Generate creates a new concept and adds the new concept to concept lattice (lines 1-2). According to Proposition 9, we test every candidate in c.Children to find real children of newConcept (lines [4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22]. Note that the concept c.children.indicator points to has already been obtained after executing the Preprocessprocedure.…”
Section: Generation and Removal Of Conceptsmentioning
confidence: 99%
See 2 more Smart Citations
“…First, the procedure Generate creates a new concept and adds the new concept to concept lattice (lines 1-2). According to Proposition 9, we test every candidate in c.Children to find real children of newConcept (lines [4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22]. Note that the concept c.children.indicator points to has already been obtained after executing the Preprocessprocedure.…”
Section: Generation and Removal Of Conceptsmentioning
confidence: 99%
“…Algorithm 1 reveals that c can be marked directly if c is a merged concept. When c is a deleted or modified concept, it requires comparisons between c andc.Parentsfor finding a parent with c.Intent = parent.Intent (lines [5][6][7][8][9][10][11][12][13]. This operation requires only one comparison in the best case or |G| comparisons at worst case between sets (intents) which takes at most O(|G||M | 2 ) time.…”
Section: Complexity Issuesmentioning
confidence: 99%
See 1 more Smart Citation