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

Jytte Klausen

dblp:188/6304 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · unresolved

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

Software engineering, systems software and programming languages · 1 · 1 since 2021

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
Graph data management · 91% Data mining · 9%

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

TopicWeightPapersLastEvidence papers
Graph data management › graph pattern matching
approximate graph pattern matching
0.612022
Enhancing Investigative Pattern Detection via Inexact Matching and Graph Databases · IEEE Trans. Serv. Comput. 2022
Graph data management
graph pattern matching
0.612022
Enhancing Investigative Pattern Detection via Inexact Matching and Graph Databases · IEEE Trans. Serv. Comput. 2022
Graph data management
graph query
0.612022
Enhancing Investigative Pattern Detection via Inexact Matching and Graph Databases · IEEE Trans. Serv. Comput. 2022
Data mining › pattern mining
behavioral pattern mining
0.212022
Enhancing Investigative Pattern Detection via Inexact Matching and Graph Databases · IEEE Trans. Serv. Comput. 2022

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

graph database scoring · 0.6
YearPublicationVenuePosition
2022 Enhancing Investigative Pattern Detection via Inexact Matching and Graph Databases
abstract
Tracking individuals or groups based on their hidden and/or emergent behaviors is an indispensable task in homeland security, mental health evaluation, and consumer analytics. On-line and off-line communication patterns, behavior profiles and social relationships form complex dynamic evolving knowledge graphs. Investigative search involves capturing and mining such large-scale knowledge graphs for emergent profiles of interest. While graph databases facilitate efficient and scalable operations on complex heterogeneous graphs, dealing with incomplete, missing and/or inconsistent information and need for adaptive querying pose major challenges. We address these by proposing an inexact graph pattern matching method, which is implemented in a graph database with a scoring mechanism that helps identify hidden behavioral patterns. PINGS (Procedures forINvestigativeGraphSearch), a graph database library of procedures for investigative graph search is presented. Results presented demonstrate the capability of detecting individuals/groups meeting query criteria as well as the iterative query performance in graph databases. We evaluate our approach on three datasets: a synthetically generated radicalization dataset, a publicly available patient’s ICU hospitalization stays dataset, and a crime dataset. These varied datasets demonstrate the wide-range applicability and the enhanced effectiveness of observing suspicious or latent trends in investigative domains.
Shashika Muramudalige, Benjamin W. K. Hung, Anura P. Jayasumana, Indrakshi Ray, Jytte Klausen
IEEE Trans. Serv. Comput.5