EDBT 2026 Demo / reviewers in the wild / expert
Ludmila Marian
dblp:02/5265
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 2011
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 2Artificial intelligence and machine learning · 1Applied, interdisciplinary, general and emerging 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.
| Databases, data mining, and information retrieval
1 paper |
Data mining · 100% |
Topics — the 1 heaviest of 1, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining › text mining › text classification
web page classification |
0.1 | 1 | 2009 | Purely URL-based topic classification · WWW 2009 |
Methods — techniques the papers use, named apart from their topics
machine learning · 0.1binary classifier · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2011 | D-Rank: A Framework for Score Aggregation in Specialized Search
Martin Vesely, Martin Rajman, Jean-Yves LeMeur, Ludmila Marian, Jérôme Caffaro |
ICAART (1) | 4 |
| 2011 | A Comprehensive Study of Features and Algorithms for URL-Based Topic ClassificationabstractGiven only the URL of a Web page, can we identify its topic? We study this problem in detail by exploring a large number of different feature sets and algorithms on several datasets. We also show that the inherent overlap between topics and the sparsity of the information in URLs makes this a very challenging problem. Web page classification without a page’s content is desirable when the content is not available at all, when a classification is needed before obtaining the content, or when classification speed is of utmost importance. For our experiments we used five different corpora comprising a total of about 3 million (URL, classification) pairs. We evaluated several techniques for feature generation and classification algorithms. The individual binary classifiers were then combined via boosting into metabinary classifiers. We achieve typical F-measure values between 80 and 85, and a typical precision of around 86. The precision can be pushed further over 90 while maintaining a typical level of recall between 30 and 40. Eda Baykan, Monika Henzinger, Ludmila Marian, Ingmar Weber |
ACM Trans. Web | 3 |
| 2009 | Purely URL-based topic classificationabstractGiven only the URL of a web page, can we identify its topic? This is the question that we examine in this paper. Usually, web pages are classified using their content, but a URL-only classifier is preferable, (i) when speed is crucial, (ii) to enable content filtering before an (objection-able) web page is downloaded, (iii) when a page's content is hidden in images, (iv) to annotate hyperlinks in a personalized web browser, without fetching the target page, and (v) when a focused crawler wants to infer the topic of a target page before devoting bandwidth to download it. We apply a machine learning approach to the topic identification task and evaluate its performance in extensive experiments on categorized web pages from the Open Directory Project (ODP). When training separate binary classifiers for each topic, we achieve typical F-measure values between 80 and 85, and a typical precision of around 85. We also ran experiments on a small data set of university web pages. For the task of classifying these pages into faculty, student, course and project pages, our methods improve over previous approaches by 13.8 points of F-measure. Eda Baykan, Monika Henzinger, Ludmila Marian, Ingmar Weber |
WWW | 3 |