VLDB 2026 Research / reviewers in the wild / expert
Dominic Widdows
dblp:87/4113
· DBLP profile ↗
22ranked-venue papers
8as first author
3since 2021 · last 2024
0000-0002-4241-0820ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 15 · 8 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 6Systems, architecture and hardware · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 80% Data models and query languages · 20% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data models and query languages › logic programming
negation |
0.0 | 1 | 2003 | Orthogonal Negation in Vector Spaces for Modelling Word-Meanings and Document Retrieval · ACL 2003 |
Information retrieval › query reformulation
query expansion |
0.0 | 1 | 2003 | Orthogonal Negation in Vector Spaces for Modelling Word-Meanings and Document Retrieval · ACL 2003 |
Information retrieval
query processing |
0.0 | 1 | 2003 | Orthogonal Negation in Vector Spaces for Modelling Word-Meanings and Document Retrieval · ACL 2003 |
Information retrieval
retrieval models |
0.0 | 1 | 2003 | Orthogonal Negation in Vector Spaces for Modelling Word-Meanings and Document Retrieval · ACL 2003 |
Information retrieval › retrieval models
vector space model |
0.0 | 1 | 2003 | Orthogonal Negation in Vector Spaces for Modelling Word-Meanings and Document Retrieval · ACL 2003 |
Methods — techniques the papers use, named apart from their topics
vector negation · 0.0quantum logic · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Actionable conversational quality indicators for improving task-oriented dialog systemsabstractAbstract Automatic dialog systems have become a mainstream part of online customer service. Many such systems are built, maintained, and improved by customer service specialists, rather than dialog systems engineers and computer programmers. As conversations between people and machines become commonplace, it is critical to understand what is working, what is not, and what actions can be taken to reduce the frequency of inappropriate system responses. These analyses and recommendations need to be presented in terms that directly reflect the user experience rather than the internal dialog processing. This paper introduces and explains the use of Actionable Conversational Quality Indicators (ACQIs), which are used both to recognize parts of dialogs that can be improved and to recommend how to improve them. This combines benefits of previous approaches, some of which have focused on producing dialog quality scoring while others have sought to categorize the types of errors the dialog system is making. We demonstrate the effectiveness of using ACQIs on LivePerson internal dialog systems used in commercial customer service applications and on the publicly available LEGOv2 conversational dataset. We report on the annotation and analysis of conversational datasets showing which ACQIs are important to fix in various situations. The annotated datasets are then used to build a predictive model which uses a turn-based vector embedding of the message texts and achieves a 79% weighted average f1-measure at the task of finding the correct ACQI for a given conversation. We predict that if such a model worked perfectly, the range of potential improvement actions a bot-builder must consider at each turn could be reduced by an average of 81%. Michael Higgins, Dominic Widdows, Beth Ann Hockey, Akshay Hazare, Kristen Howell, Gwen Christian, Sujit Mathi, Chris Brew, Andrew Maurer, George Bonev, Matthew Dunn, Joseph Bradley |
Nat. Lang. Eng. | 2 |
| 2022 | Quantum Text Encoding for Classification TasksabstractThis paper explores text classification on quantum computers. Previous results have achieved perfect accuracy on an artificial dataset of 100 short sentences, but at the unscalable cost of using a qubit for each word. This paper demonstrates that an amplitude encoded feature map combined with a quantum support vector machine can achieve 62% average accuracy predicting sentiment using a dataset of 50 actual movie reviews. This is still small, but considerably larger than previously-reported results in quantum NLP. Aaranya Alexander, Dominic Widdows |
SEC | 2 |
| 2021 | Quantum Mathematics in Artificial IntelligenceabstractIn the decade since 2010, successes in artificial intelligence have been at the forefront of computer science and technology, and vector space models have solidified a position at the forefront of artificial intelligence. At the same time, quantum computers have become much more powerful, and announcements of major advances are frequently in the news. The mathematical techniques underlying both these areas have more in common than is sometimes realized. Vector spaces took a position at the axiomatic heart of quantum mechanics in the 1930s, and this adoption was a key motivation for the derivation of logic and probability from the linear geometry of vector spaces. Quantum interactions between particles are modelled using the tensor product, which is also used to express objects and operations in artificial neural networks. This paper describes some of these common mathematical areas, including examples of how they are used in artificial intelligence (AI), particularly in automated reasoning and natural language processing (NLP). Techniques discussed include vector spaces, scalar products, subspaces and implication, orthogonal projection and negation, dual vectors, density matrices, positive operators, and tensor products. Application areas include information retrieval, categorization and implication, modelling word-senses and disambiguation, inference in knowledge bases, decision making, and and semantic composition. Some of these approaches can potentially be implemented on quantum hardware. Many of the practical steps in this implementation are in early stages, and some are already realized. Explaining some of the common mathematical tools can help researchers in both AI and quantum computing further exploit these overlaps, recognizing and exploring new directions along the way.This paper describes some of these common mathematical areas, including examples of how they are used in artificial intelligence (AI), particularly in automated reasoning and natural language processing (NLP). Techniques discussed include vector spaces, scalar products, subspaces and implication, orthogonal projection and negation, dual vectors, density matrices, positive operators, and tensor products. Application areas include information retrieval, categorization and implication, modelling word-senses and disambiguation, inference in knowledge bases, and semantic composition. Some of these approaches can potentially be implemented on quantum hardware. Many of the practical steps in this implementation are in early stages, and some are already realized. Explaining some of the common mathematical tools can help researchers in both AI and quantum computing further exploit these overlaps, recognizing and exploring new directions along the way. Dominic Widdows, Kirsty Kitto, Trevor Cohen |
J. Artif. Intell. Res. | 1 |
| 2018 | Bringing Order to Neural Word Embeddings with Embeddings Augmented by Random Permutations (EARP)abstractWord order is clearly a vital part of human language, but it has been used comparatively lightly in distributional vector models.This paper presents a new method for incorporating word order information into word vector embedding models by combining the benefits of permutation-based order encoding with the more recent method of skip-gram with negative sampling.The new method introduced here is called Embeddings Augmented by Random Permutations (EARP).It operates by applying permutations to the coordinates of context vector representations during the process of training.Results show an 8% improvement in accuracy on the challenging Bigger Analogy Test Set, and smaller but consistent improvements on other analogy reference sets.These findings demonstrate the importance of order-based information in analogical retrieval tasks, and the utility of random permutations as a means to augment neural embeddings. Trevor Cohen, Dominic Widdows |
CoNLL | 2 |
| 2017 | Embedding of semantic predications
Trevor Cohen, Dominic Widdows |
J. Biomed. Informatics | 2 |
| 2012 | Deterministic Binary Vectors for Efficient Automated Indexing of MEDLINE/PubMed Abstracts
Manuel Wahle, Dominic Widdows, Jorge R. Herskovic, Elmer V. Bernstam, Trevor Cohen |
AMIA | 2 |
| 2012 | Discovering discovery patterns with predication-based Semantic Indexing
Trevor Cohen, Dominic Widdows, Roger W. Schvaneveldt, Peter Davies 0002, Thomas C. Rindflesch |
J. Biomed. Informatics | 2 |
| 2010 | Reflective Random Indexing and indirect inference: A scalable method for discovery of implicit connections
Trevor Cohen, Roger W. Schvaneveldt, Dominic Widdows |
J. Biomed. Informatics | 3 |
| 2009 | Empirical distributional semantics: Methods and biomedical applications
Trevor Cohen, Dominic Widdows |
J. Biomed. Informatics | 2 |
| 2008 | Semantic Vectors: a Scalable Open Source Package and Online Technology Management Application
Dominic Widdows, Kathleen Ferraro |
LREC | 1 |
| 2006 | Adapting WordNet to the Medical Domain using Lexicosyntactic Patterns in the Ohsumed CorpusabstractOntologies are widely used in several areas with applications including knowledge Management, Web commerce and electronic business. An ontology provides a consensus of concept specifications for a specific domain shared by a group of people. In this paper we deal with Ontology Learning, specifically we aim to adapt the WordNet ontology, a general source of lexical knowledge, to the medical domain. We use for this task a combination of lexico– syntactic pattern, mainly conjunctions of the form “Noun_CJC_Noun”, where CJC can be {and, or, but}. Pairs of words extracted in this fashion are compared to find their similarity in the WordNet noun hierarchy, using a form of the Resnik similarity method. Large scale experiments were conducted by extracting many such pairs of nouns from the Ohsumed corpus and mapping them into WordNet. For a noun pattern like “A or B” we find the lowest common ancestor of A and B by using the hypernym and hyponym links. This enables us to keep the appropriate medical sense of the two words A and B. Adil Toumouh, Ahmed Lehireche, Dominic Widdows, Mimoun Malki |
AICCSA | 3 |
| 2006 | The Information Commons Gazetteer
Peter Lucas 0002, Magesh Balasubramanya, Dominic Widdows, Michael Higgins |
LREC | 3 |
| 2006 | Collaborative Annotation that Lasts Forever: Using Peer-to-Peer Technology for Disseminating Corpora and Language Resources
Magesh Balasubramanya, Michael Higgins, Peter Lucas 0002, Jeffrey Senn, Dominic Widdows |
LREC | 5 |
| 2006 | Ongoing Developments in Automatically Adapting Lexical Resources to the Biomedical Domain
Dominic Widdows, Adil Toumouh, Beate Dorow, Ahmed Lehireche |
LREC | 1 |
| 2004 | Evaluation Resources for Concept-based Cross-Lingual Information Retrieval in the Medical Domain
Paul Buitelaar, Diana Steffen, Martin Volk 0001, Dominic Widdows, Bogdan Sacaleanu, Spela Vintar, Stanley Peters, Hans Uszkoreit |
LREC | 4 |
| 2003 | Orthogonal Negation in Vector Spaces for Modelling Word-Meanings and Document RetrievalabstractStandard IR systems can process queries such as "web NOT internet", enabling users who are interested in arachnids to avoid documents about computing. The documents retrieved for such a query should be irrelevant to the negated query term. Most systems implement this by reprocessing results after retrieval to remove documents containing the unwanted string of letters.This paper describes and evaluates a theoretically motivated method for removing unwanted meanings directly from the original query in vector models, with the same vector negation operator as used in quantum logic. Irrelevance in vector spaces is modelled using orthogonality, so query vectors are made orthogonal to the negated term or terms.As well as removing unwanted terms, this form of vector negation reduces the occurrence of synonyms and neighbours of the negated terms by as much as 76% compared with standard Boolean methods. By altering the query vector itself, vector negation removes not only unwanted strings but unwanted meanings. Dominic Widdows |
ACL | 1 |
| 2003 | Using LSA and Noun Coordination Information to Improve the Recall and Precision of Automatic Hyponymy Extraction
Scott Cederberg, Dominic Widdows |
CoNLL | 2 |
| 2003 | Discovering Corpus-Specific Word Senses
Beate Dorow, Dominic Widdows |
EACL | 2 |
| 2003 | Unsupervised methods for developing taxonomies by combining syntactic and statistical information
Dominic Widdows |
HLT-NAACL | 1 |
| 2003 | Monolingual and Bilingual Concept Visualization from Corpora
Dominic Widdows, Scott Cederberg |
HLT-NAACL | 1 |
| 2002 | A Graph Model for Unsupervised Lexical Acquisition
Dominic Widdows, Beate Dorow |
COLING | 1 |
| 2002 | Using Parallel Corpora to enrich Multilingual Lexical Resources
Dominic Widdows, Beate Dorow, Chiu-Ki Chan |
LREC | 1 |