Demo Data from SIGIR 2026 / reviewers in the wild / expert
S. S. Upda
dblp:06/1033
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2001
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Human-computer interaction and ubiquitous 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 |
Image recognition and object detection · 100% | |
| Computer graphics and multimedia
1 paper |
Image and video processing · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › Image recognition and object detection
handwriting recognition |
0.0 | 1 | 1992 | Recognition of Arabic Characters · IEEE Trans. Pattern Anal. Mach. Intell. 1992 |
Image and video processing › document image analysis
character segmentation |
0.0 | 1 | 1992 | Recognition of Arabic Characters · IEEE Trans. Pattern Anal. Mach. Intell. 1992 |
Methods — techniques the papers use, named apart from their topics
quadratic discriminant analysis · 0.0moment invariants · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2001 | Learn++: an incremental learning algorithm for supervised neural networksabstractWe introduce Learn++, an algorithm for incremental training of neural network (NN) pattern classifiers. The proposed algorithm enables supervised NN paradigms, such as the multilayer perceptron (MLP), to accommodate new data, including examples that correspond to previously unseen classes. Furthermore, the algorithm does not require access to previously used data during subsequent incremental learning sessions, yet at the same time, it does not forget previously acquired knowledge. Learn++ utilizes ensemble of classifiers by generating multiple hypotheses using training data sampled according to carefully tailored distributions. The outputs of the resulting classifiers are combined using a weighted majority voting procedure. We present simulation results on several benchmark datasets as well as a real-world classification task. Initial results indicate that the proposed algorithm works rather well in practice. A theoretical upper bound on the error of the classifiers constructed by Learn++ is also provided. Robi Polikar, L. Upda, S. S. Upda, Vasant G. Honavar |
IEEE Trans. Syst. Man Cybern. Part C | 3 |
| 1992 | Recognition of Arabic CharactersabstractA statistical approach for the recognition of Arabic characters is introduced. As a first step, the character is segmented into primary and secondary parts (dots and zigzags). The secondary parts of the character are then isolated and identified separately, thereby reducing the number of classes from 28 to 18. The moments of the horizontal and vertical projections of the remaining primary characters are then calculated and normalized with respect to the zero-order moment. Simple measures of the shape are obtained from the normalized moments. A 9-D feature vector is obtained for each character. Classification is accomplished using quadratic discriminant functions. The approach was evaluated using isolated, handwritten, and printed characters from a database established for this purpose. The results indicate that the technique offers better classification rates in comparison with existing methods.> H. Al-Yousefi, S. S. Upda |
IEEE Trans. Pattern Anal. Mach. Intell. | 2 |