Demo Data from SIGIR 2026 / reviewers in the wild / expert
Barry Robson
dblp:92/6417
· DBLP profile ↗
5ranked-venue papers
4as first author
1since 2021 · last 2024
0009-0004-4523-5492ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author · 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.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › sequence analysis
sequence compression |
0.0 | 1 | 1992 | Natural sequence code representations for compression and rapid searching of human-genome style databases · Comput. Appl. Biosci. 1992 |
Bioinformatics and computational biology › sequence analysis › sequence similarity search
sequence database search |
0.0 | 1 | 1992 | Natural sequence code representations for compression and rapid searching of human-genome style databases · Comput. Appl. Biosci. 1992 |
Methods — techniques the papers use, named apart from their topics
fast-search algorithms · 0.0bit-level encoding · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Use of a theory of expected information for sparse data and adverse events in clinical trials and other biomedical studies
Barry Robson, O. K. Baek |
Inf. Sci. | 1 |
| 2015 | Interesting things for computer systems to do: Keeping and data mining millions of patient records, guiding patients and physicians, and passing medical licensing examsabstractThe extraction of medical knowledge from data mining many patient records and from authoritative natural language text on the Internet is important for clinical decision support. Here is discussed how such knowledge expressed in our Q-UEL language as semantic triples analogous to subject-verb-object, and now more elaborate semantic multiples, can respond to examination-style medical questions in natural language. Importantly, it is also discussed how our inference methods can be used to assign a probability to each answer in the set of candidate answers. We had intended to “show off” the power of our Q-UEL language by drawing on its many algorithmic and knowledge archive resources. However, in view of the simplicity of the approach used here, originally only intended to set prior probabilities, it is interesting that it is often alone sufficient to give the right answer, giving performance comparable to that of a typical medical student. Nonetheless, it still needs a large knowledge representation store, and Q-UEL has several tools to extract and integrate knowledge from (a) structured data, (b) unstructured data, and (c) by dialogue with human experts. Barry Robson, Srinidhi Boray |
BIBM | 1 |
| 2000 | Simplified models of protein folding exploiting the Lagrange radius of gyration of the hydrophobic component
Barry Robson |
Parallel Comput. | 1 |
| 1992 | Natural sequence code representations for compression and rapid searching of human-genome style databasesabstractNumeric descriptions ('bio-informatic descriptions') of amino acid residues have been developed which will be of value whenever the quality and quantity of information in very large (i.e. 'human genome style') gene and protein sequences is to be compared or manipulated. These codes are as natural as possible by our criteria (the same principles could be used in revision of the criteria). In particular, in storing and searching large amounts of sequence data, natural codes--which relate to the properties of amino acids--can be combined with existing fast-search algorithms but introduce several advantages. The code can be assigned such that sub-selection of bits leads to compressed databases with residues defined less specifically, by classes of properties. The most compressed representation leads to the specification of a residue as polar or non-polar, while the most extended representation used at present also allows specification of, for example, glyco-asparagine and phosphoserine. Preliminary studies on both a supercomputer and smaller machines suggest a 'worst-case' speeding of approximately 4.5-fold. For more intelligent searching, coding extensions mixed with the basic sequence data give the sequence data some of the character of a computer program. Barry Robson, P. J. Greaney |
Comput. Appl. Biosci. | 1 |
| 1990 | A study of parallel molecular dynamics algorithms for N-body simulations on a transputer system
Jin Li 0004, Andy Brass, D. J. Ward, Barry Robson |
Parallel Comput. | 4 |