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

Viljan Mahnic

dblp:54/3698 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2015
0000-0002-4196-2084ORCID · reported

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

Software engineering, systems software and programming languages · 2 · 1 first-authorArtificial intelligence and machine learning · 1Systems, architecture and hardware · 1 · 1 first-authorDatabases, 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
Web and social media mining · 100%

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

TopicWeightPapersLastEvidence papers
Web and social media mining › web usage mining
clickstream analysis
0.112010
Separation of Interleaved Web Sessions with Heuristic Search · ICDM 2010
Web and social media mining
user behavior analysis
0.112010
Separation of Interleaved Web Sessions with Heuristic Search · ICDM 2010

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

markov chain · 0.1heuristic search · 0.1best-first search · 0.1
YearPublicationVenuePosition
2015 Converting metamodels to graph grammars: doing without advanced graph grammar features
Luka Fürst, Marjan Mernik, Viljan Mahnic
Softw. Syst. Model.3
2012 On using planning poker for estimating user stories
Viljan Mahnic, Tomaz Hovelja
J. Syst. Softw.1
2010 Separation of Interleaved Web Sessions with Heuristic Search
abstract
We describe a heuristic search-based method for interleaved HTTP (Web) session reconstruction building upon first order Markov models. An interleaved session is generated by a user who is concurrently browsing the same web site in two or more web sessions (browser tabs or windows). In order to assure data quality for subsequent phases in analyzing user's browsing behavior, such sessions need to be separated in advance. We propose a separating process based on best-first search and trained first order Markov chains. We develop a testing method based on various measures of reconstructed sessions similarity to original ones. We evaluate the developed method on two real world click stream data sources: a web shop and a university student records information system. Preliminary results show that the proposed method performs well.
Marko Pozenel, Viljan Mahnic, Matjaz Kukar
ICDM2
1991 Using grid files for a relational database management system
Viljan Mahnic
Microprocessing and Microprogramming1