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

Pavel Dmitriev

dblp:94/4011 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2009
0000-0001-5740-5146ORCID · corroborated

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

Databases, data management, data science and information retrieval · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 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.

Databases, data mining, and information retrieval
2 papers
Web and social media mining · 43% Information retrieval · 29% Data mining · 29%
Computer networks
1 paper
Internet architecture and protocols · 100%

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

TopicWeightPapersLastEvidence papers
Web and social media mining › web mining
web graph analysis
0.112009
The web of nations · WWW 2009
Data mining › clustering › document clustering
web page clustering
0.112008
As we may perceive: finding the boundaries of compound documents on the web · WWW 2008
Information retrieval
web search
0.112008
As we may perceive: finding the boundaries of compound documents on the web · WWW 2008

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

web-scale crawl · 0.2graph analysis · 0.2machine learning-based clustering · 0.1graph-based clustering · 0.1conditional markov network · 0.1
YearPublicationVenuePosition
2009 The web of nations
abstract
In this paper, we report on a large-scale study of structural differences among the national webs. The study is based on a web-scale crawl conducted in the summer 2008. More specifically, we study two graphs derived from this crawl, the nation graph, with nodes corresponding to nations and edges - to links among nations, and the host graph, with nodes corresponding to hosts and edges - to hyperlinks among pages on the hosts. Contrary to some of the previous work [2], our results show that webs of different nations are often very different from each other, both in terms of their internal structure, and in terms of their connectivity with other nations.
Sukwon Chung, Dungjit Shiowattana, Pavel Dmitriev, Su Chan
WWW3
2008 As we may perceive: finding the boundaries of compound documents on the web
abstract
This paper considers the problem of identifying on the Web compound documents (cDocs) -- groups of web pages that in aggregate constitute semantically coherent information entities. Examples of cDocs are a news article consisting of several html pages, or a set of pages describing specifications, price, and reviews of a digital camera. Being able to identify cDocs would be useful in many applications including web and intranet search, user navigation, automated collection generation, and information extraction.In the past, several heuristic approaches have been proposed to identify cDocs [1][5]. However, heuristics fail to capture the variety of types, styles and goals of information on the web, and do not account for the fact that the definition of a cDoc often depends on the context. This paper presents an experimental evaluation of three machine learning-based algorithms for cDoc discovery. These algorithms are responsive to the varying structure of cDocs and adaptive to their application-specific nature. Based on our previous work [4], this paper proposes a different scenario for discovering cDocs, and compares in this new setting the local machine learned clustering algorithm from [4] to a global purely graph based approach [3] and a Conditional Markov Network approach previously applied to noun coreference task [6]. The results show that the approach of [4] outperforms the other algorithms, suggesting that global relational characteristics of web sites are too noisy for cDoc identification purposes.
Pavel Dmitriev
WWW1