Demo Data from SIGIR 2026 / reviewers in the wild / expert
Jörg Lange
dblp:24/590
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 1999
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1Applied, interdisciplinary, general and emerging computing · 1
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.
| Artificial intelligence
1 paper |
Face, body and person analysis · 67% Image recognition and object detection · 33% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% | |
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology
gene expression analysis |
0.0 | 1 | 1999 | An algorithm for clustering cDNAs for gene expression analysis · RECOMB 1999 |
Graph algorithms and graph theory
graph clustering |
0.0 | 1 | 1999 | An algorithm for clustering cDNAs for gene expression analysis · RECOMB 1999 |
Computer vision › Face, body and person analysis › face recognition › feature-based face recognition
elastic graph matching |
0.0 | 1 | 1993 | Distortion Invariant Object Recognition in the Dynamic Link Architecture · IEEE Trans. Computers 1993 |
Computer vision › Face, body and person analysis
face recognition |
0.0 | 1 | 1993 | Distortion Invariant Object Recognition in the Dynamic Link Architecture · IEEE Trans. Computers 1993 |
Computer vision › Image recognition and object detection
object recognition |
0.0 | 1 | 1993 | Distortion Invariant Object Recognition in the Dynamic Link Architecture · IEEE Trans. Computers 1993 |
Methods — techniques the papers use, named apart from their topics
graph-theoretic clustering · 0.0stochastic optimization · 0.0multiresolution local power spectrum · 0.0elastic graph matching · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1999 | An algorithm for clustering cDNAs for gene expression analysisabstractWe have developed a novel algorithm for cluster analysis that is based on graph theoretic techniques. A similarity graph is defined and clusters in that graph correspond to highly connected subgraphs. A polynomial algorithm to compute them efficiently is presented. Our algorithm produces a clustering with some provably good properties. The application that motivated this study was gene expression analysis, where a collection of cDNAs must be clustered based on their oligonucleotide fingerprints. The algorithm has been tested intensively on simulated libraries and was shown to outperform extant methods. It demonstrated robustness to high noise levels. In a blind test on real cDNA fingerprint data the algorithm obtained very good results. Utilizing the results of the algorithm would have saved over 70% of the cDNA sequencing cost on that data set. 1 Introduction Cluster analysis seeks grouping of data elements into subsets, so that elements in the same subset are in some sense more cl... Erez Hartuv, Armin O. Schmitt, Jörg Lange, Sebastian Meier-Ewert, Hans Lehrach, Ron Shamir |
RECOMB | 3 |
| 1993 | Distortion Invariant Object Recognition in the Dynamic Link ArchitectureabstractAn object recognition system based on the dynamic link architecture, an extension to classical artificial neural networks (ANNs), is presented. The dynamic link architecture exploits correlations in the fine-scale temporal structure of cellular signals to group neurons dynamically into higher-order entities. These entities represent a rich structure and can code for high-level objects. To demonstrate the capabilities of the dynamic link architecture, a program was implemented that can recognize human faces and other objects from video images. Memorized objects are represented by sparse graphs, whose vertices are labeled by a multiresolution description in terms of a local power spectrum, and whose edges are labeled by geometrical distance vectors. Object recognition can be formulated as elastic graph matching, which is performed here by stochastic optimization of a matching cost function. The implementation on a transputer network achieved recognition of human faces and office objects from gray-level camera images. The performance of the program is evaluated by a statistical analysis of recognition results from a portrait gallery comprising images of 87 persons.> Martin Lades, Jan C. Vorbrüggen, Joachim M. Buhmann, Jörg Lange, Christoph von der Malsburg, Rolf P. Würtz, Wolfgang Konen |
IEEE Trans. Computers | 4 |