Demo Data from SIGIR 2026 / reviewers in the wild / expert
Thomas R. Addis
dblp:68/5902
· DBLP profile ↗
5ranked-venue papers
3as first author
0since 2021 · last 2006
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Human-computer interaction and ubiquitous computing · 3 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 2Databases, data management, data science and information retrieval · 1 · 1 first-author
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.
| Software engineering, system software, and programming languages
1 paper |
Programming languages and type systems · 77% Requirements engineering and software design · 23% | |
| Databases, data mining, and information retrieval
1 paper |
Query processing and optimization · 44% Database system architecture and tuning · 44% Data mining · 13% |
Topics — the 5 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Programming languages and type systems
functional programming |
0.0 | 1 | 2002 | An introduction to clarity: a schematic functional language for managing the design of complex systems · Int. J. Hum. Comput. Stud. 2002 |
Requirements engineering and software design
software architecture |
0.0 | 1 | 2002 | An introduction to clarity: a schematic functional language for managing the design of complex systems · Int. J. Hum. Comput. Stud. 2002 |
Database system architecture and tuning › database machine
content addressable file store |
0.0 | 1 | 1982 | A Relation-Based Language Interpreter for Content Addressable File Store · ACM Trans. Database Syst. 1982 |
Natural language and speech › Language models and text generation
natural language understanding |
0.0 | 1 | 1977 | Machine Understanding of Natural Language · Int. J. Man Mach. Stud. 1977 |
Data mining
relational data analysis |
0.0 | 1 | 1982 | A Relation-Based Language Interpreter for Content Addressable File Store · ACM Trans. Database Syst. 1982 |
Methods — techniques the papers use, named apart from their topics
world model · 0.0relational analysis · 0.0machine understanding · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2006 | Automating the Abductive Inference LoopabstractWe present a novel approach to handle uncertainty, by assuming an irrational view of the world thus breaking with the tradition of taking a rational view. We propose a solution that handles irrationalities by generating different hypotheses of the environment and testing these for their validity thereby fully automating the abductive loop. By assuming the irrational view, we focus on a fundamental change in relation to existing formal techniques that have been developed over the past decades for dealing with uncertain information. While other methods assume a set of axioms to describe the basic building blocks of the problem domain and use these to build concepts. The new approach, unlike the requirements of a rational system, has no predefined problem domain concepts and any concept can be generated and selected based on their ability to be useful in fulfilling the purpose. This means a completely dynamic ontology is generated and maintained. In this way the proposed system could probably cope with any type of problem domain. Coen J. C. Stevens, Bart-Floris Visscher, Thomas R. Addis |
SMC | 3 |
| 2002 | How Weak Categorizers Based Upon Different Principles Strengthen PerformanceabstractCombining the results of classifiers has shown much promise in machine learning generally. However, published work on combining text categorizers suggests that, for this particular application, improvements in performance are hard to attain. Explorative research using a simple voting system is presented and discussed in the light of a probabilistic model that was originally developed for safety critical software. It was found that typical categorization approaches produce predictions which are too similar for combining them to be effective since they tend to fail on the same records. Further experiments using two less orthodox categorizers are also presented which suggest that combining text categorizers can be successful, provided the essential element of ‘difference’ is considered. Victoria S. Uren, Thomas R. Addis |
Comput. J. | 2 |
| 2002 | An introduction to clarity: a schematic functional language for managing the design of complex systems
Thomas R. Addis, J. J. Townsend Addis |
Int. J. Hum. Comput. Stud. | 1 |
| 1982 | A Relation-Based Language Interpreter for Content Addressable File StoreabstractThe combination of the Content Addressable File Store (CAFS®; CAFS is a registered trademark of International Computers Limited) and an extension of relational analysis is described. This combination allows a simple and compact implementation of a database query and update language (FIDL). The language has one of the important properties of a “natural” language interface by using a “world model” derived from the relational analysis. The interpreter (FLIN) takes full advantage of the CAFS by employing a unique database storage technique which results in a fast response to both queries and updates. Thomas R. Addis |
ACM Trans. Database Syst. | 1 |
| 1977 | Machine Understanding of Natural Language
Thomas R. Addis |
Int. J. Man Mach. Stud. | 1 |