Benchmarking Sentence Embeddings in Textual Stream Clustering with Applications to Campaign Detection

Stampe, Lucas; Stockdiek, Janina Lütke; Grimme, Britta; Grimme, Christian

doi:10.1109/ijcnn60899.2024.10650595

2024 International Joint Conference on Neural Networks (IJCNN) 2024

DOI: 10.1109/ijcnn60899.2024.10650595

|View full text |Cite

Benchmarking Sentence Embeddings in Textual Stream Clustering with Applications to Campaign Detection

Lucas Stampe,

Janina Lütke Stockdiek,

Britta Grimme

et al.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

An Entropy-Based Clustering Algorithm for Real-Time High-Dimensional IoT Data Streams

Mutambik

2024

Sensors

View full text Add to dashboard Cite

The rapid growth of data streams, propelled by the proliferation of sensors and Internet of Things (IoT) devices, presents significant challenges for real-time clustering of high-dimensional data. Traditional clustering algorithms struggle with high dimensionality, memory and time constraints, and adapting to dynamically evolving data. Existing dimensionality reduction methods often neglect feature ranking, leading to suboptimal clustering performance. To address these issues, we introduce E-Stream, a novel entropy-based clustering algorithm for high-dimensional data streams. E-Stream performs real-time feature ranking based on entropy within a sliding time window to identify the most informative features, which are then utilized with the DenStream algorithm for efficient clustering. We evaluated E-Stream using the NSL-KDD dataset, comparing it against DenStream, CluStream, and MR-Stream. The evaluation metrics included the average F-Measure, Jaccard Index, Fowlkes–Mallows Index, Purity, and Rand Index. The results show that E-Stream outperformed the baseline algorithms in both clustering accuracy and computational efficiency while effectively reducing dimensionality. E-Stream also demonstrated significantly less memory consumption and fewer computational requirements, highlighting its suitability for real-time processing of high-dimensional data streams. Despite its strengths, E-Stream requires manual parameter adjustment and assumes a consistent number of active features, which may limit its adaptability to diverse datasets. Future work will focus on developing a fully autonomous, parameter-free version of the algorithm, incorporating mechanisms to handle missing features and improving the management of evolving clusters to enhance robustness and adaptability in dynamic IoT environments.

show abstract

An Entropy-Based Clustering Algorithm for Real-Time High-Dimensional IoT Data Streams

Mutambik

2024

Sensors

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Benchmarking Sentence Embeddings in Textual Stream Clustering with Applications to Campaign Detection

Cited by 1 publication

References 27 publications

An Entropy-Based Clustering Algorithm for Real-Time High-Dimensional IoT Data Streams

An Entropy-Based Clustering Algorithm for Real-Time High-Dimensional IoT Data Streams

Contact Info

Product

Resources

About