Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Dionyssios D. Sourlas

dblp:124/0843 · also Dionysios D. Sourlas · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 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.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Artificial intelligence
1 paper
3D vision · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

Topics — the 3 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval
image retrieval
0.212013
Mining User Queries with Markov Chains: Application to Online Image Retrieval · IEEE Trans. Knowl. Data Eng. 2013
Information retrieval
retrieval models
0.212013
Mining User Queries with Markov Chains: Application to Online Image Retrieval · IEEE Trans. Knowl. Data Eng. 2013
Information retrieval › indexing
semantic indexing
0.212013
Mining User Queries with Markov Chains: Application to Online Image Retrieval · IEEE Trans. Knowl. Data Eng. 2013

Methods — techniques the papers use, named apart from their topics

vertex localization · 0.7noise analysis · 0.7mean first cross passage time · 0.2markov chain · 0.2aggregate markov chain · 0.2
YearPublicationVenuePosition
2018 On the Beneficial Effect of Noise in Vertex Localization
Konstantinos Raftopoulos, Stefanos D. Kollias, Dionyssios D. Sourlas, Marin Ferecatu
Int. J. Comput. Vis.3
2013 Mining User Queries with Markov Chains: Application to Online Image Retrieval
abstract
We propose a novel method for automatic annotation, indexing and annotation-based retrieval of images. The new method, that we call Markovian Semantic Indexing (MSI), is presented in the context of an online image retrieval system. Assuming such a system, the users' queries are used to construct an Aggregate Markov Chain (AMC) through which the relevance between the keywords seen by the system is defined. The users' queries are also used to automatically annotate the images. A stochastic distance between images, based on their annotation and the keyword relevance captured in the AMC, is then introduced. Geometric interpretations of the proposed distance are provided and its relation to a clustering in the keyword space is investigated. By means of a new measure of Markovian state similarity, the mean first cross passage time (CPT), optimality properties of the proposed distance are proved. Images are modeled as points in a vector space and their similarity is measured with MSI. The new method is shown to possess certain theoretical advantages and also to achieve better Precision versus Recall results when compared to Latent Semantic Indexing (LSI) and probabilistic Latent Semantic Indexing (pLSI) methods in Annotation-Based Image Retrieval (ABIR) tasks.
Konstantinos Raftopoulos, Klimis S. Ntalianis, Dionyssios D. Sourlas, Stefanos D. Kollias
IEEE Trans. Knowl. Data Eng.3