Demo Data from VLDB 2026 / reviewers in the wild / expert
Reza Shams
dblp:60/3641
· DBLP profile ↗
3ranked-venue papers
1as first author
1since 2021 · last 2021
0000-0003-1565-806XORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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.
| Artificial intelligence
2 papers |
Planning, search and constraint satisfaction · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
game tree search |
0.0 | 2 | 1991 | Minimax Search Algorithms With and Without Aspiration Windows · IEEE Trans. Pattern Anal. Mach. Intell. 1991 Using Aspiration Windows for Minimax Algorithms · IJCAI 1991 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › game tree search
minimax search |
0.0 | 2 | 1991 | Minimax Search Algorithms With and Without Aspiration Windows · IEEE Trans. Pattern Anal. Mach. Intell. 1991 Using Aspiration Windows for Minimax Algorithms · IJCAI 1991 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › game tree search › minimax search
alpha-beta pruning |
0.0 | 1 | 1991 | Minimax Search Algorithms With and Without Aspiration Windows · IEEE Trans. Pattern Anal. Mach. Intell. 1991 |
Methods — techniques the papers use, named apart from their topics
statistical analysis · 0.0backward pruning · 0.0alpha-beta pruning · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | A New Optimal Ensemble Algorithm Based on SVDD Sampling for Imbalanced Data ClassificationabstractNowadays, imbalanced data classification is a hot topic in data mining and recently, several valuable researches have been conducted to overcome certain difficulties in the field. Moreover, those approaches, which are based on ensemble classifiers, have achieved reasonable results. Despite the success of these works, there are still many unsolved issues such as disregarding the importance of samples in balancing, determination of proper number of classifiers and optimizing weights of base classifiers in voting stage of ensemble methods. This paper intends to find an admissible solution for these challenges. The solution suggested in this paper applies the support vector data descriptor (SVDD) for sampling both minority and majority classes. After determining the optimal number of base classifiers, the selected samples are utilized to adjust base classifiers. Finally, genetic algorithm optimization is used in order to find the optimum weights of each base classifier in the voting stage. The proposed method is compared with some existing algorithms. The results of experiments confirm its effectiveness. Jamshid Pirgazi, Abbas Pirmohammadi, Reza Shams |
Int. J. Pattern Recognit. Artif. Intell. | 3 |
| 1991 | Using Aspiration Windows for Minimax Algorithms
Reza Shams, Hermann Kaindl, Helmut Horacek |
IJCAI | 1 |
| 1991 | Minimax Search Algorithms With and Without Aspiration WindowsabstractInvestigation of several algorithms for computing exact minimax values of game trees (utilizing backward pruning) are discussed. The focus is on trees with an ordering similar to that actually found in game playing practice. The authors compare the algorithms using two different distributions of the static values, the uniform distribution and a distribution estimated from practical data. A systematic comparison of using aspiration windows for all of the usual minimax algorithms is presented. The effects of aspiration windows of varying size and position are analyzed. Increasing the ordering of moves to near the optimum results in unexpectedly high savings. Algorithms with linear space complexity benefit most. Although the ordering of the first move is of predominant importance, that of the remainder has only second-order effects. The use of an aspiration window not only makes alpha-beta search competitive, but there also exist dependencies of its effects on certain properties of the trees.> Hermann Kaindl, Reza Shams, Helmut Horacek |
IEEE Trans. Pattern Anal. Mach. Intell. | 2 |