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

Sujeet Pradhan

dblp:02/6136 · DBLP profile ↗
← Back
8ranked-venue papers
7as first author
0since 2021 · last 2013
—ORCID · none

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

Databases, data management, data science and information retrieval · 8 · 7 first-authorArtificial intelligence and machine learning · 3 · 2 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.

Databases, data mining, and information retrieval
2 papers
Data models and query languages · 44% Information retrieval · 35% Spatial and temporal data management · 22%
Computer graphics and multimedia
1 paper
Multimedia analysis and retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › query understanding
query modeling
0.012001
A Query Model to Synthesize Answer Intervals from Indexed Video Units · IEEE Trans. Knowl. Data Eng. 2001
Information retrieval › document retrieval › structured document retrieval
XML retrieval
0.012006
An Algebraic Query Model for Effective and Efficient Retrieval of XML Fragments · VLDB 2006
Multimedia analysis and retrieval › multimedia database
video database
0.012001
A Query Model to Synthesize Answer Intervals from Indexed Video Units · IEEE Trans. Knowl. Data Eng. 2001

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

relevance ranking · 0.1interval synthesis · 0.1
YearPublicationVenuePosition
2013 Extending information unit across media streams for improving retrieval effectiveness
Nimit Pattanasri, Sujeet Pradhan, Katsumi Tanaka
Data Knowl. Eng.2
2009 Two-Dimensional Retrieval in Synchronized Media Streams
Sujeet Pradhan, Nimit Pattanasri
DASFAA1
2007 Towards a Novel Desktop Search Technique
Sujeet Pradhan
DEXA1
2006 An Algebraic Query Model for Effective and Efficient Retrieval of XML Fragments
Sujeet Pradhan
VLDB1
2005 Optimization Issues for Keyword Search over Tree-Structured Documents
Sujeet Pradhan, Katsumi Tanaka
WISE1
2004 Retrieving Relevant Portions from Structured Digital Documents
Sujeet Pradhan, Katsumi Tanaka
DEXA1
2004 A Framework for the Relational Implementation of Tree Algebra to Retrieve Structured Document Fragments
Sujeet Pradhan
WISE1
2001 A Query Model to Synthesize Answer Intervals from Indexed Video Units
abstract
While a query result in a traditional database is a subset of the database, in a video database, it is a set of subintervals extracted from the raw video sequence. It is very hard, if not impossible, to predetermine all the queries that will be issued in the future, and all the subintervals that will become necessary to answer them. As a result, conventional query frameworks are not applicable to video databases. We propose a new video query model that computes query results by dynamically synthesizing needed subintervals from fragmentary indexed intervals in the database. We introduce new interval operations required for that computation. We also propose methods to compute relative relevance of synthesized intervals to a given query. A query result is a list of synthesized intervals sorted in the order of their degree of relevance.
Sujeet Pradhan, Keishi Tajima, Katsumi Tanaka
IEEE Trans. Knowl. Data Eng.1