English
Related papers

Related papers: MATE: Multi-Attribute Table Extraction

200 papers

Finding Minimal Unsatisfiable Subsets (MUSes) of binary constraints is a common problem in infeasibility analysis of over-constrained systems. However, because of the exponential search space of the problem, enumerating MUSes is extremely…

Artificial Intelligence · Computer Science 2024-02-27 Panagiotis Lymperopoulos , Liping Liu

Recent table representation learning and data discovery methods tackle table union search (TUS) within data lakes, which involves identifying tables that can be unioned with a given query table to enrich its content. These methods are…

Information Retrieval · Computer Science 2025-05-29 Allaa Boutaleb , Bernd Amann , Hubert Naacke , Rafael Angarita

Data mining is the practice to search large amount of data to discover data patterns. Data mining uses mathematical algorithms to group the data and evaluate the future events. Association rule is a research area in the field of knowledge…

Databases · Computer Science 2013-02-08 Jnanamurthy H. K.

The last decade has seen a flurry of research on all-pairs-similarity-search (or, self-join) for text, DNA, and a handful of other datatypes, and these systems have been applied to many diverse data mining problems. Surprisingly, however,…

Machine Learning · Computer Science 2020-07-14 Chin-Chia Michael Yeh

This paper proposes Text mAtching based SequenTial rEcommendation model (TASTE), which maps items and users in an embedding space and recommends items by matching their text representations. TASTE verbalizes items and user-item interactions…

Information Retrieval · Computer Science 2023-08-29 Zhenghao Liu , Sen Mei , Chenyan Xiong , Xiaohua Li , Shi Yu , Zhiyuan Liu , Yu Gu , Ge Yu

Given a set $S$ of $n$ keys, a perfect hash function for $S$ maps the keys in $S$ to the first $m \geq n$ integers without collisions. It may return an arbitrary result for any key not in $S$ and is called minimal if $m = n$. The most…

Data Structures and Algorithms · Computer Science 2026-02-06 Hans-Peter Lehmann , Thomas Mueller , Rasmus Pagh , Giulio Ermanno Pibiri , Peter Sanders , Sebastiano Vigna , Stefan Walzer

Nonnegative matrix factorization (NMF) is a powerful tool in data exploratory analysis by discovering the hidden features and part-based patterns from high-dimensional data. NMF and its variants have been successfully applied into diverse…

Computer Vision and Pattern Recognition · Computer Science 2017-07-27 Lihua Zhang , Shihua Zhang

Causal discovery is a crucial initial step in establishing causality from empirical data and background knowledge. Numerous algorithms have been developed for this purpose. Among them, the score-matching method has demonstrated superior…

Machine Learning · Statistics 2026-04-14 Hao Chen , Kai Yi

Tabular data generation has become increasingly essential for enabling robust machine learning applications, which require large-scale, high-quality data. Existing solutions leverage generative models to learn original data distributions.…

Machine Learning · Computer Science 2025-12-29 Yafeng Tang , Xiaoou Ding , Jianzhuo Du , Zishuo Yan , Zhuang Ma , Zheng Liang , Zekai Qian , Hongzhi Wang

Over the past decade, the Table Union Search (TUS) task has aimed to identify unionable tables within data lakes to improve data integration and discovery. While numerous solutions and approaches have been introduced, they primarily rely on…

Databases · Computer Science 2025-03-03 Margherita Martorana , Tobias Kuhn , Jacco van Ossenbruggen

High-utility itemset mining finds itemsets from a transaction database with utility no less than a fixed user-defined threshold. The utility of an itemset is defined as the sum of the utilities of its item. Several algorithms were proposed…

Data Structures and Algorithms · Computer Science 2019-11-19 Siddharth Dawar , Vikram Goyal , Debajyoti Bera

Artificial intelligence (AI) has emerged as a powerful accelerator of materials discovery, yet most existing models remain problem-specific, requiring additional data collection and retraining for each new property. Here we introduce and…

We study the problem of set discovery where given a few example tuples of a desired set, we want to find the set in a collection of sets. A challenge is that the example tuples may not uniquely identify a set, and a large number of…

Databases · Computer Science 2022-10-05 Arif Hasnat , Davood Rafiei

Efficiently identifying keyphrases that represent a given document is a challenging task. In the last years, plethora of keyword detection approaches were proposed. These approaches can be based on statistical (frequency-based) properties…

Information Retrieval · Computer Science 2023-12-25 Blaž Škrlj , Boshko Koloski , Senja Pollak

Tabular anomaly detection is often handled by single detectors or static ensembles, even though strong performance on tabular data typically comes from heterogeneous model families (e.g., tree ensembles, deep tabular networks, and tabular…

Machine Learning · Computer Science 2026-02-17 Pinqiao Wang , Sheng Li

Table filling based relational triple extraction methods are attracting growing research interests due to their promising performance and their abilities on extracting triples from complex sentences. However, this kind of methods are far…

Computation and Language · Computer Science 2021-09-15 Feiliang Ren , Longhui Zhang , Shujuan Yin , Xiaofeng Zhao , Shilei Liu , Bochao Li , Yaduo Liu

Deep neural networks (DNN) are increasingly being accelerated on application-specific hardware such as the Google TPU designed especially for deep learning. Timing speculation is a promising approach to further increase the energy…

Machine Learning · Computer Science 2018-07-03 Jeff Zhang , Siddharth Garg

Extracting information from tables in documents presents a significant challenge in many industries and in academic research. Existing methods which take a bottom-up approach of integrating lines into cells and rows or columns neglect the…

Neural and Evolutionary Computing · Computer Science 2019-04-04 Nataliya Le Vine , Matthew Zeigenfuse , Mark Rowan

Leveraging external knowledge is crucial for achieving high performance in knowledge-intensive tasks, such as question answering. The retrieve-and-read approach is widely adopted for integrating external knowledge into a language model.…

Computation and Language · Computer Science 2024-06-10 Dongkyu Lee , Chandana Satya Prakash , Jack FitzGerald , Jens Lehmann

Deep learning models trained on large-scale data have achieved encouraging performance in many real-world tasks. Meanwhile, publishing those models trained on sensitive datasets, such as medical records, could pose serious privacy concerns.…

Machine Learning · Computer Science 2022-11-04 Qiuchen Zhang , Jing Ma , Jian Lou , Li Xiong , Xiaoqian Jiang