2016
DOI: 10.1007/s11633-016-1038-7
|View full text |Cite
|
Sign up to set email alerts
|

An effective density based approach to detect complex data clusters using notion of neighborhood difference

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(2 citation statements)
references
References 24 publications
0
2
0
Order By: Relevance
“…Density-based clustering algorithms include density-based spatial clustering of applications with noise (DBSCAN). Created in 1996, this was the first algorithm to use data density [89].…”
Section: Density-based Clusteringmentioning
confidence: 99%
“…Density-based clustering algorithms include density-based spatial clustering of applications with noise (DBSCAN). Created in 1996, this was the first algorithm to use data density [89].…”
Section: Density-based Clusteringmentioning
confidence: 99%
“…The significance is that the developer can pre-determine a desired performance through the model and can determine the proportion of developers in each development project, so that the total development risk is minimized. Different expectation performance has different minimum variance combinations, which constitutes the minimum variance set [4]. It provides a good means to accurately measure the risk and performance of securities development projects, but this model involves calculating the covariance matrix of all assets.…”
Section: Grey Clustering Extraction and Analysis Algorithmmentioning
confidence: 99%