2009 WRI World Congress on Computer Science and Information Engineering 2009
DOI: 10.1109/csie.2009.997
|View full text |Cite
|
Sign up to set email alerts
|

The Shared Nearest Neighbor Algorithm with Enclosures (SNNAE)

Abstract: Unsupervised learning is that part of machine learning whose purpose is to find some hidden structure within data. Typical task in unsupervised learning include the discovery of "natural" clusters present in the data, known as clustering.The SNN clustering algorithm is one of the most efficient clustering algorithms which can handle most of the issues related to clustering, like, it can generate clusters of different sizes, shapes and densities.This paper is about handling large dataset, which is not possible … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 4 publications
0
2
0
Order By: Relevance
“…We propose a semi-supervised learning approach where we first derive different clusters mainly based on the clustering coefficient and vertex degree. To analyze the normalized data and detect crypto mining, we employ an enhanced semisupervised algorithm based on the Shared Nearest Neighbour (SNN) clustering algorithm [27]. The SNN clustering defines similarity or proximity between two nodes in terms of the number of directly connected neighbors they have in common.…”
Section: Methodology and Proposed Frameworkmentioning
confidence: 99%
“…We propose a semi-supervised learning approach where we first derive different clusters mainly based on the clustering coefficient and vertex degree. To analyze the normalized data and detect crypto mining, we employ an enhanced semisupervised algorithm based on the Shared Nearest Neighbour (SNN) clustering algorithm [27]. The SNN clustering defines similarity or proximity between two nodes in terms of the number of directly connected neighbors they have in common.…”
Section: Methodology and Proposed Frameworkmentioning
confidence: 99%
“…Figure 1 shows a schematic diagram of a rough set F within the upper and lower approximations, consisting of granules from the rectangular grid. 3 …”
Section: Rough Setmentioning
confidence: 97%