2019
DOI: 10.1007/s00521-019-04243-4
|View full text |Cite
|
Sign up to set email alerts
|

Parallel multi-view concept clustering in distributed computing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(2 citation statements)
references
References 39 publications
0
2
0
Order By: Relevance
“…Roughly speaking, the existing methods can be divided into two categories. The first class of methods try to fuse the features [12,13], while the others integrate clusterings [14]. Nevertheless, these methods are susceptible to poor quality data, which lead to degraded clustering performance.…”
Section: Introductionmentioning
confidence: 99%
“…Roughly speaking, the existing methods can be divided into two categories. The first class of methods try to fuse the features [12,13], while the others integrate clusterings [14]. Nevertheless, these methods are susceptible to poor quality data, which lead to degraded clustering performance.…”
Section: Introductionmentioning
confidence: 99%
“…Specifically, ODEFS uses a given outlier scoring method to compute initial outlier scores of data objects, and then defines an outlier thresholding function to identify a set of outlier candidates. Considering that diverse outliers may have different discriminative feature subsets (Wang et al 2019b;Wang and Li 2006), ODEFS builds an ensemble framework to obtain multiple feature subsets by bagging. It randomly chooses examples from both outlier candidates and the unlabeled objects.…”
Section: Introductionmentioning
confidence: 99%