Image de couverture de livre

HITSnDIFFs: From Truth Discovery to Ability Discovery by Recovering Matrices with the Consecutive Ones Property

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chen, Zixuan, Mitra, Subhodeep, Ravi, R, Gatterbauer, Wolfgang
Format:	Preprint
Publié:	2023
Sujets:	Social and Information Networks Databases Data Structures and Algorithms Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The Importance of Parameters in Ranking Functions
par: Standke, Christoph, et autres
Publié: (2026)

Finding Near-Optimal Maximum Set of Disjoint $k$-Cliques in Real-World Social Networks
par: Lin, Wenqing, et autres
Publié: (2025)

An Efficient Streaming Algorithm for Approximating Graphlet Distributions
par: Bressan, Marco, et autres
Publié: (2026)

Effective Individual Fairest Community Search over Heterogeneous Information Networks
par: Zhao, Taige, et autres
Publié: (2024)

Counting hypertriangles through hypergraph orientations
par: Paul-Pena, Daniel, et autres
Publié: (2026)

In-depth Analysis of Densest Subgraph Discovery in a Unified Framework
par: Zhou, Yingli, et autres
Publié: (2024)

Accurate and Fast Estimation of Temporal Motifs using Path Sampling
par: Pan, Yunjie, et autres
Publié: (2024)

Triadic First-Order Logic Queries in Temporal Networks
par: Bhalerao, Omkar, et autres
Publié: (2025)

A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets
par: Li, Xuan, et autres
Publié: (2024)

Graph Discovery and Source Detection in Temporal Graphs
par: Bals, Ben
Publié: (2025)

Scalable Temporal Motif Densest Subnetwork Discovery
par: Sarpe, Ilie, et autres
Publié: (2024)

Evaluating Regular Path Queries on Compressed Adjacency Matrices
par: Arroyuelo, Diego, et autres
Publié: (2023)

BEACON: A Benchmark for Efficient and Accurate Counting of Subgraphs
par: Najafi, Mohammad Matin, et autres
Publié: (2025)

Enabling Asymptotic Truth Learning in a Social Network
par: Lu, Kevin, et autres
Publié: (2024)

Efficiently Constructing Sparse Navigable Graphs
par: Conway, Alex, et autres
Publié: (2025)

On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
par: Wang, Carrie, et autres
Publié: (2025)

Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search
par: Gao, Jianyang, et autres
Publié: (2024)

jXBW: Fast Substructure Search for Large-Scale JSONL Datasets with LLM Applications
par: Tabei, Yasuo
Publié: (2025)

SAQ: Pushing the Limits of Vector Quantization through Code Adjustment and Dimension Segmentation
par: Li, Hui, et autres
Publié: (2025)

CARAMEL: A Succinct Read-Only Lookup Table via Compressed Static Functions
par: Coleman, Benjamin, et autres
Publié: (2023)

Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
par: Iff, Patrick, et autres
Publié: (2025)

GPU-Native Approximate Nearest Neighbor Search with IVF-RaBitQ: Fast Index Build and Search
par: Shi, Jifan, et autres
Publié: (2026)

Diversity-Aware $k$-Maximum Inner Product Search Revisited
par: Huang, Qiang, et autres
Publié: (2024)

Autumn: A Scalable Read Optimized LSM-tree based Key-Value Stores with Fast Point and Range Read Speed
par: Zhao, Fuheng, et autres
Publié: (2023)

iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
par: Xu, Yuexuan, et autres
Publié: (2024)

Linked Array Tree: A Constant-Time Search Structure for Big Data
par: Liu, Songpeng
Publié: (2025)

MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encodings
par: Dhulipala, Laxman, et autres
Publié: (2024)

TIMEST: Temporal Information Motif Estimator Using Sampling Trees
par: Pan, Yunjie, et autres
Publié: (2025)

Correlation Sketches for Approximate Join-Correlation Queries
par: Santos, Aécio, et autres
Publié: (2021)

RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
par: Gao, Jianyang, et autres
Publié: (2024)

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search
par: Azizi, Ilias, et autres
Publié: (2025)

How to Train Your Filter: Should You Learn, Stack or Adapt?
par: Sabale, Diandre Miguel, et autres
Publié: (2026)

Retrieval with Learned Similarities
par: Ding, Bailu, et autres
Publié: (2024)

Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search
par: Al-Jazzazi, Yousef, et autres
Publié: (2025)

Model-Free Counterfactual Subset Selection at Scale
par: Nguyen, Minh Hieu, et autres
Publié: (2025)

Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum
par: Carmeli, Nofar, et autres
Publié: (2025)

Improved Approximation Algorithms for Relational Clustering
par: Esmailpour, Aryan, et autres
Publié: (2024)

Algorithms for Optimizing Acyclic Queries
par: Luo, Zheng, et autres
Publié: (2025)

Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs
par: De Man, Quinten, et autres
Publié: (2026)

A Unified and Scalable Algorithm Framework of User-Defined Temporal $(k,\mathcal{X})$-Core Query
par: Zhong, Ming, et autres
Publié: (2023)