2020
DOI: 10.31449/inf.v44i1.2672
|View full text |Cite
|
Sign up to set email alerts
|

Hybrid Nearest Neighbors Ant Colony Optimization for Clustering Social Media Comments

Abstract: Ant colony optimization (ACO) is one of robust algorithms for solving optimization problems, including clustering. However, high and redundant computation is needed to select the proper cluster for each object, especially when the data dimensionality is high, such as social media comments. Reducing the redundant computation may cut the execution time, but it can potentially decrease the quality of clustering. With the basic idea that nearby objects tend to be in the same cluster, the nearest neighbors method c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
3
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 24 publications
(43 reference statements)
0
3
0
Order By: Relevance
“…KNN is a simple and versatile technique applicable to various applications, although it may be computationally costly for big datasets and high-dimensional feature spaces. KNN has been implemented in several domains, including bioinformatics, image processing, and recommendation systems (El Houby et al, 2017).…”
Section: K-nearest Neighborsmentioning
confidence: 99%
“…KNN is a simple and versatile technique applicable to various applications, although it may be computationally costly for big datasets and high-dimensional feature spaces. KNN has been implemented in several domains, including bioinformatics, image processing, and recommendation systems (El Houby et al, 2017).…”
Section: K-nearest Neighborsmentioning
confidence: 99%
“…Related works on ACO-based data stream algorithms have mainly focused on clustering, [52][53][54][55] an unsupervised † learning task where the goal is to group data instances based on their features into homogeneous clusters. The only exception, to the best of our knowledge, is the Stream Ant Colony Decision Forrest (strACDF) algorithm proposed in Reference [56] for solving the data stream e-mail foldering problem.…”
Section: Classification With Acomentioning
confidence: 99%
“…Clustering Protocol) [19] The authors proposed a clustering protocol for RCSFHs, based on a dual phase CH election scheme. So we have 2 steps to choose the CH of the cluster, the first step is the initial and temporary CH selection based on the primary and residual energy level, and the second step is the process of replacing the temporary CHs with high power CHs to form the final CH of the cluster.…”
Section: Dce (Distributed Energy-efficientmentioning
confidence: 99%
“…A connected object has value when it is connected to other objects and software bricks, for example: a connected watch is only of interest within a health/wellness oriented ecosystem, which goes far beyond knowing the time. An CO with three key elements: The data produced or received, stored or transmitted, the algorithms to process this data, the ecosystem in which it will react and integrate.The usage properties of a CO [18], [19]: Ergonomics (usability, handiness).Aesthetics (shapes /colors/ sounds/ sensations). Meta-Morphism(adaptability, personalization modulation).…”
Section: Connected Object (Co)mentioning
confidence: 99%