Big data searching using words
Santanu Acharjee, Ripunjoy Choudhury

TL;DR
This paper explores the foundational topological concepts of neighborhood structures in big data search, proposing a framework that uses word relationships and similarity measures to detect anomalies, aiming to advance big data analysis techniques.
Contribution
It introduces fundamental topological concepts related to word neighborhoods in big data search and proposes a new framework for anomaly detection using these structures.
Findings
Neighborhood structures can reveal insights into big data search behavior.
Jaccard similarity effectively detects anomalies in search patterns.
Fundamental topological concepts are essential for future big data frameworks.
Abstract
Big data analytics is one of the most promising areas of new research and development in computer science, enterprises, e-commerce, and defense. For many organizations, big data is considered one of their most important strategic assets. This explosive growth has made it necessary to develop effective techniques for examining and analyzing big data from mathematical perspectives. Among various methods of analyzing big data, topological data analysis (TDA) is now considered one of the useful tools. However, there is no fundamental concept related to the topological structure in big data. In this paper, we present fundamental concepts related to the neighborhood structures of words in big data search, laying the groundwork for developing topological frameworks for big data in the future. We also introduce the notion of big data primal within the context of big data search and explore how…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBig Data Technologies and Applications
