2021
DOI: 10.1007/s13042-021-01295-8
|View full text |Cite
|
Sign up to set email alerts
|

Multi-view document clustering based on geometrical similarity measurement

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 23 publications
(14 citation statements)
references
References 60 publications
0
14
0
Order By: Relevance
“…A robust document similarity metric is proposed in [23], by which they are doing the clustering of documents.For the similarity measure of documents this may contribute in summarization works also. Three way clustering scheme is used in [24] to find out the relationship between data items and clusters.A multi view clustering technique by customizing the K-means algorithm is also suggesting in this paper.…”
Section: Related Workmentioning
confidence: 99%
“…A robust document similarity metric is proposed in [23], by which they are doing the clustering of documents.For the similarity measure of documents this may contribute in summarization works also. Three way clustering scheme is used in [24] to find out the relationship between data items and clusters.A multi view clustering technique by customizing the K-means algorithm is also suggesting in this paper.…”
Section: Related Workmentioning
confidence: 99%
“…Then, based on the clothing mask values π’Žπ’Ž οΏ½ c , a final edited face image π’šπ’š οΏ½ is generated. Equation (10) describes the process of generating the final edited face image π’šπ’š οΏ½.…”
Section: Test Processmentioning
confidence: 99%
“…An approach to solve this problem is to incorporate additional information into the training or to add a loss function to the model to suppress unwanted changes. For example, in recent clustering-related studies, multi-view clustering was utilized to improve the clustering accuracy using data from various sources together [9][10][11]. In addition, in a study on deep embedding clustering, the performance was improved by applying a contractive autoencoder and adding the Frobenius norm as a penalty term [12].…”
Section: Introductionmentioning
confidence: 99%
“…This requires data clustering and outlier analysis to ensure the quality of landmark matching. Clustering algorithms have been extensively studied in recent years [34,35,36,37]. Local Outlier Factor (LOF) [38] can be used to find outliers and remove these matching pairs.…”
Section: 𝐢𝐢𝐢𝐢𝐢𝐢(𝐿𝐿𝐿𝐿_𝐹𝐹 𝐴𝐴mentioning
confidence: 99%