Imagen de Portada

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

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Chen, Zixuan, Mitra, Subhodeep, Ravi, R, Gatterbauer, Wolfgang
Formato:	Preprint
Publicado:	2023
Materias:	Social and Information Networks Databases Data Structures and Algorithms Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

The Importance of Parameters in Ranking Functions
por: Standke, Christoph, et al.
Publicado: (2026)

Finding Near-Optimal Maximum Set of Disjoint $k$-Cliques in Real-World Social Networks
por: Lin, Wenqing, et al.
Publicado: (2025)

An Efficient Streaming Algorithm for Approximating Graphlet Distributions
por: Bressan, Marco, et al.
Publicado: (2026)

Effective Individual Fairest Community Search over Heterogeneous Information Networks
por: Zhao, Taige, et al.
Publicado: (2024)

Counting hypertriangles through hypergraph orientations
por: Paul-Pena, Daniel, et al.
Publicado: (2026)

In-depth Analysis of Densest Subgraph Discovery in a Unified Framework
por: Zhou, Yingli, et al.
Publicado: (2024)

Accurate and Fast Estimation of Temporal Motifs using Path Sampling
por: Pan, Yunjie, et al.
Publicado: (2024)

Triadic First-Order Logic Queries in Temporal Networks
por: Bhalerao, Omkar, et al.
Publicado: (2025)

A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets
por: Li, Xuan, et al.
Publicado: (2024)

Graph Discovery and Source Detection in Temporal Graphs
por: Bals, Ben
Publicado: (2025)

Scalable Temporal Motif Densest Subnetwork Discovery
por: Sarpe, Ilie, et al.
Publicado: (2024)

Evaluating Regular Path Queries on Compressed Adjacency Matrices
por: Arroyuelo, Diego, et al.
Publicado: (2023)

BEACON: A Benchmark for Efficient and Accurate Counting of Subgraphs
por: Najafi, Mohammad Matin, et al.
Publicado: (2025)

Enabling Asymptotic Truth Learning in a Social Network
por: Lu, Kevin, et al.
Publicado: (2024)

Efficiently Constructing Sparse Navigable Graphs
por: Conway, Alex, et al.
Publicado: (2025)

On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
por: Wang, Carrie, et al.
Publicado: (2025)

Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search
por: Gao, Jianyang, et al.
Publicado: (2024)

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

SAQ: Pushing the Limits of Vector Quantization through Code Adjustment and Dimension Segmentation
por: Li, Hui, et al.
Publicado: (2025)

CARAMEL: A Succinct Read-Only Lookup Table via Compressed Static Functions
por: Coleman, Benjamin, et al.
Publicado: (2023)

Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
por: Iff, Patrick, et al.
Publicado: (2025)

GPU-Native Approximate Nearest Neighbor Search with IVF-RaBitQ: Fast Index Build and Search
por: Shi, Jifan, et al.
Publicado: (2026)

Diversity-Aware $k$-Maximum Inner Product Search Revisited
por: Huang, Qiang, et al.
Publicado: (2024)

Autumn: A Scalable Read Optimized LSM-tree based Key-Value Stores with Fast Point and Range Read Speed
por: Zhao, Fuheng, et al.
Publicado: (2023)

iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
por: Xu, Yuexuan, et al.
Publicado: (2024)

Linked Array Tree: A Constant-Time Search Structure for Big Data
por: Liu, Songpeng
Publicado: (2025)

MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encodings
por: Dhulipala, Laxman, et al.
Publicado: (2024)

TIMEST: Temporal Information Motif Estimator Using Sampling Trees
por: Pan, Yunjie, et al.
Publicado: (2025)

Correlation Sketches for Approximate Join-Correlation Queries
por: Santos, Aécio, et al.
Publicado: (2021)

RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
por: Gao, Jianyang, et al.
Publicado: (2024)

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search
por: Azizi, Ilias, et al.
Publicado: (2025)

How to Train Your Filter: Should You Learn, Stack or Adapt?
por: Sabale, Diandre Miguel, et al.
Publicado: (2026)

Retrieval with Learned Similarities
por: Ding, Bailu, et al.
Publicado: (2024)

Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search
por: Al-Jazzazi, Yousef, et al.
Publicado: (2025)

Model-Free Counterfactual Subset Selection at Scale
por: Nguyen, Minh Hieu, et al.
Publicado: (2025)

Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum
por: Carmeli, Nofar, et al.
Publicado: (2025)

Improved Approximation Algorithms for Relational Clustering
por: Esmailpour, Aryan, et al.
Publicado: (2024)

Algorithms for Optimizing Acyclic Queries
por: Luo, Zheng, et al.
Publicado: (2025)

Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs
por: De Man, Quinten, et al.
Publicado: (2026)

A Unified and Scalable Algorithm Framework of User-Defined Temporal $(k,\mathcal{X})$-Core Query
por: Zhong, Ming, et al.
Publicado: (2023)