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

Michal Holub

dblp:90/59 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2015
0000-0002-3101-9068ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1Human-computer interaction and ubiquitous 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
Recommender systems · 67% Web and social media mining · 33%

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

TopicWeightPapersLastEvidence papers
Web and social media mining › user behavior analysis
user behavior modeling
0.112010
Estimation of user interest in visited web page · WWW 2010
Recommender systems › user interest modeling
user interest inference
0.112010
Estimation of user interest in visited web page · WWW 2010
Recommender systems
web personalization
0.112010
Estimation of user interest in visited web page · WWW 2010

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

adaptive link recommendation · 0.1
YearPublicationVenuePosition
2015 Detecting Identical Entities in the Semantic Web Data
Michal Holub, Ondrej Proksa, Mária Bieliková
SOFSEM1
2010 Estimation of user interest in visited web page
abstract
Nowadays web portals contain large amount of information that is meant for various visitors or groups of visitors. To effectively navigate within the content the website needs to "know" its users in order to provide personalized content to them. We propose a method for automatic estimation of the user's interest in a web page he visits. This estimation is used for the recommendation of web portal pages (through presenting adaptive links) that the user might like. We conducted series of experiments in the domain of our faculty web portal to evaluate proposed approach.
Michal Holub, Mária Bieliková
WWW1
2001 A Scaleable Approach to Visualization of Large Virtual Cities
abstract
Visualization of large urban complexes on the Web is a highly demanding task both from the networking and computational point of view. The whole three-dimensional model of a city is mostly too big to be downloaded in a reasonable time and to be stored in a memory of commonly used computers. This paper presents a scalable approach for subdividing an urban model into smaller parts. Dynamic loading and unloading data allows theoretically unlimited extension of a model with constant network and computation load. Further requirements specific to presentation of virtual cities are also discussed. Theoretical considerations are followed by a practical implementation utilizing the VRML language for modeling the historical city of Prague.
Jirí Zára, Pavel Chromy, Jiri Cizek, Kamil Ghais, Michal Holub, Stanislav Mikes, Jakub Rajnoch
IV5