Finding Frequent Entities in Continuous Data
In many applications that involve processing high-dimensional data, it is important to identify a small set of entities that account for a significant fraction of detections. Rather than formalize this as a clustering problem, in which all detections must be grouped into hard or soft categories, we formalize it as an instance of the frequent items or heavy hitters problem, which finds groups of tightly clustered objects that have a high density in the feature space. We show that the heavy hitters formulation generates solutions that are more accurate and effective than the clustering formulation. In addition, we present a novel online algorithm for heavy hitters, called HAC, which addresses problems in continuous space, and demonstrate its effectiveness on real video and household domains.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringSimilar Papers 제목 키워드 기반
All Entities are Not Created Equal: Examining the Long Tail for Fine-Grained Entity Typing
Pre-trained language models (PLMs) are trained on large amounts of data, which helps capture world knowledge alongside linguistic competence. Due to this, they are extensively used for ultra-fine entity typing tasks, whe…
AllEntity TypingWorld KnowledgeBeyond Facts: Benchmarking Distributional Reading Comprehension in Large Language Models
While most reading comprehension benchmarks for LLMs focus on factual information that can be answered by localizing specific textual evidence, many real-world tasks require understanding distributional information, such…
Reading ComprehensionRecord Deduplication for Entity Distribution Modeling in ASR Transcripts
Voice digital assistants must keep up with trending search queries. We rely on a speech recognition model using contextual biasing with a rapidly updated set of entities, instead of frequent model retraining, to keep up …
Entity Resolutionspeech-recognitionSpeech RecognitionTackling Long-Tailed Relations and Uncommon Entities in Knowledge Graph Completion
For large-scale knowledge graphs (KGs), recent research has been focusing on the large proportion of infrequent relations which have been ignored by previous studies. For example few-shot learning paradigm for relations …
Few-Shot LearningKnowledge Graph CompletionKnowledge GraphsMeta-LearningDomain-based Latent Personal Analysis and its use for impersonation detection in social media
Zipf's law defines an inverse proportion between a word's ranking in a given corpus and its frequency in it, roughly dividing the vocabulary into frequent words and infrequent ones. Here, we stipulate that within a domai…
Authorship Attribution