2019
DOI: 10.1016/j.future.2019.05.029
|View full text |Cite
|
Sign up to set email alerts
|

FCA-based knowledge representation and local generalized linear models to address relevance and diversity in diverse social images

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 17 publications
0
3
0
Order By: Relevance
“…The process ends when a stop criterion is reached, often the number k of clusters. At the end of the algorithm, a clustering dendrogram is created, which is a binary tree hierarchy [40,67,72,73]. A possible hierarchical clustering considering the spatial arrangement between samples 1-6 of Figure 6a is illustrated in Figure 6b.…”
Section: Hierarchical Algorithmsmentioning
confidence: 99%
“…The process ends when a stop criterion is reached, often the number k of clusters. At the end of the algorithm, a clustering dendrogram is created, which is a binary tree hierarchy [40,67,72,73]. A possible hierarchical clustering considering the spatial arrangement between samples 1-6 of Figure 6a is illustrated in Figure 6b.…”
Section: Hierarchical Algorithmsmentioning
confidence: 99%
“…For this reason, scholars have carried out a lot of research work and made remarkable achievements, such as TransE [15], [16], TransH [17], TransR [18], STransH [19], TransA [20] and so on. In these models, TransE is considered as the most potential model because of its simple operation, high computing efficiency [21], effective handling of multiple relational data problems, and wide application. But, we note that TransE does not do well in dealing with one-to-many, many-to-one, many-to-many relationships.…”
Section: Introductionmentioning
confidence: 99%
“…In general, a formal concept consists of extension and intension, and is the formal and mathematical description of concepts in philosophy. Since Wille [1] proposed formal concept analysis (FCA) for constructing lattice theory in 1982, FCA has been widely used in data analysis [2–4], information retrieval [5], data mining [6], medical diagnosis [7], machine learning [8] and many other fields [9, 10]. The semi‐concept proposed by Luksch and Wille [11] in 1991 is a branch of FCA, and the binary relation expressed by it is unidirectional, which makes any set of objects and attributes are semi‐concepts.…”
Section: Introductionmentioning
confidence: 99%