Saved in:
Bibliographic Details
Main Authors: Acharjee, Santanu, Choudhury, Ripunjoy
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2409.15346
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916844179292160
author Acharjee, Santanu
Choudhury, Ripunjoy
author_facet Acharjee, Santanu
Choudhury, Ripunjoy
contents 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 neighborhood structures, combined with the Jaccard similarity coefficient, can be utilized to detect anomalies in search behavior.
format Preprint
id arxiv_https___arxiv_org_abs_2409_15346
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Big data searching using words
Acharjee, Santanu
Choudhury, Ripunjoy
Information Retrieval
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 neighborhood structures, combined with the Jaccard similarity coefficient, can be utilized to detect anomalies in search behavior.
title Big data searching using words
topic Information Retrieval
url https://arxiv.org/abs/2409.15346