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

Kaja Zupanc

dblp:160/5938 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 2020
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 2 · 2 first-authorTheory of computation · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 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.

Artificial intelligence
2 papers
Knowledge representation and reasoning · 85% Information extraction and text analysis · 15%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computing education · 100%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning › logic programming › inductive logic programming
first-order rule learning
0.312018
Estimating Rule Quality for Knowledge Base Completion with the Relationship between Coverage Assumption · WWW 2018
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge graph reasoning
knowledge base completion
0.312018
Estimating Rule Quality for Knowledge Base Completion with the Relationship between Coverage Assumption · WWW 2018
Knowledge, reasoning and agents › Knowledge representation and reasoning › rule learning
rule quality estimation
0.312018
Estimating Rule Quality for Knowledge Base Completion with the Relationship between Coverage Assumption · WWW 2018
Computing education
automated assessment
0.212014
Automated Essay Evaluation Augmented with Semantic Coherence Measures · ICDM 2014
Computing education › automated assessment
automated essay scoring
0.212014
Automated Essay Evaluation Augmented with Semantic Coherence Measures · ICDM 2014

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

semantic coherence measures · 0.4rule quality metric · 0.3coverage assumption · 0.3
YearPublicationVenuePosition
2020 Improvement of Automated Essay Grading by Grouping Similar Graders
abstract
Automated essay evaluation is a widely used practical solution for replacing time-consuming manual grading of student essays. Automated systems are used in combination with human graders in different high-stake assessments, where grading models are learned on essays datasets scored by different gra ders. Despite the definition of the standardized grading rules, human graders can unintentionally introduce subjective bias into scores. Consequently, a grading model has to learn from data that represents a noisy relationship between essay attributes and its grade. We propose an approach for partitioning a set of essays into subsets that represent similar graders, which uses an explanation methodology and clustering. The results confirm our assumption that learning from the ensemble of separated models can significantly improve the average prediction accuracy on artificial and real-world datasets.
Kaja Zupanc, Zoran Bosnic
Fundam. Informaticae1
2018 Estimating Rule Quality for Knowledge Base Completion with the Relationship between Coverage Assumption
abstract
Currently, there are many large, automatically constructed knowledge bases (KBs). One interesting task is learning from a knowledge base to generate new knowledge either in the form of inferred facts or rules that define regularities. One challenge for learning is that KBs are necessarily open world: we cannot assume anything about the truth values of tuples not included in the KB. When a KB only contains facts (i.e., true statements), which is typically the case, we lack negative examples, which are often needed by learning algorithms. To address this problem, we propose a novel score function for evaluating the quality of a first-order rule learned from a KB. Our metric attempts to include information about the tuples not in the KB when evaluating the quality of a potential rule. Empirically, we find that our metric results in more precise predictions than previous approaches.
Kaja Zupanc, Jesse Davis
WWW1
2017 Automated essay evaluation with semantic analysis
Kaja Zupanc, Zoran Bosnic
Knowl. Based Syst.1
2014 Automated Essay Evaluation Augmented with Semantic Coherence Measures
abstract
Manual grading of students' essays is a time-consuming, labor-intensive and expensive activity for educational institutions. It is nevertheless necessary since essays are considered to be the most useful tool to assess learning outcomes. Automated essay evaluation represents a practical solution to this task, however, its main weakness is predominant focus on vocabulary and text syntax, and limited consideration of text semantics. In this work, we propose an extension to existing automated essay evaluation systems that incorporates additional semantic attributes. We design the novel attributes by transforming sequential parts of an essay into the semantic space and measuring changes between them to estimate coherence of the text. The resulting system (called SAGE - Semantic Automated Grader for Essays) achieves significantly higher grading accuracy compared with 8 other state-of-the-art automated essay evaluation systems.
Kaja Zupanc, Zoran Bosnic
ICDM1