CareerPathKG: Knowledge Graph Integrated Framework for Career Intelligence (2026.eacl-industry)
Copied to clipboard
| Challenge: | a new framework for career orientation is needed to address the challenges of the labor market . a recent study found that traditional ML and large language models are brittle when faced with heterogeneous job descriptions . |
| Approach: | They propose a career-path knowledge graph-based recruitment framework to capture occupations, skill requirements and career transitions using standardized taxonomies enriched with job-posting data. |
| Outcome: | The proposed framework captures occupations, skill requirements, and career transitions using standardized taxonomies enriched with job-posting data. |
Similar Papers
JobMatchAI - An Intelligent Job Matching Platform Using Knowledge Graphs, Semantic Search and Explainable AI (2026.acl-demo)
Copied to clipboard
| Challenge: | Recruiters and job seekers rely on search systems to navigate labor markets . many systems fail to handle skill synonyms and nonlinear careers . |
| Approach: | They propose a production-ready system that integrates Transformer embeddings, skill knowledge graphs, and interpretable reranking. |
| Outcome: | The proposed system optimizes utility across skill fit, experience, location, salary, and company preferences. |
Identify, Align, and Integrate: Matching Knowledge Graphs to Commonsense Reasoning Tasks (2021.eacl-main)
Copied to clipboard
| Challenge: | Empirically, we investigate KG matches for the SocialIQA, Physical IQA, and MCScript2.0 datasets with 3 diverse KGs: ATOMIC (SIQA), ConceptNet (Speer et al., 2017), and an automatically constructed instructional KG based on WikiHow (Ostermann e., 2019b). |
| Approach: | They propose a method to assess how well a candidate KG can fill in knowledge gaps for a given task by using commonsense probes. |
| Outcome: | Empirically, we show that the proposed KG-to-task match is a good match for socialIQA, physical IQA, and MCScript2.0 datasets with 3 diverse KGs: ATOMIC, ConceptNet, and an instructional KG based on WikiHow. |
Tree-KG: An Expandable Knowledge Graph Construction Framework for Knowledge-intensive Domains (2025.acl-long)
Copied to clipboard
| Challenge: | Knowledge graphs are a useful tool for organizing complex data in knowledge-intensive domains. |
| Approach: | They propose an expandable framework that combines structured domain texts with advanced semantic techniques to create a tree-like graph from textbooks. |
| Outcome: | The proposed framework surpasses competing methods in the text-Annotated dataset with high scores on the Text-Annalytated data. |
Unmasking Fake Careers: Detecting Machine-Generated Career Trajectories via Multi-layer Heterogeneous Graphs (2025.emnlp-main)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) generate convincing career trajectories in fake resumes . a novel heterogeneous, hierarchical multi-layer graph framework is proposed to model career entities and their relations in a unified global graph built from genuine resumes. |
| Approach: | They propose a novel heterogeneous, hierarchical multi-layer graph framework that models career entities and their relations in a unified global graph built from genuine resumes. |
| Outcome: | The proposed framework outperforms state-of-the-art models by 5.8-85.0% relative to baselines. |
Knowledge Graph Embeddings using Neural Ito Process: From Multiple Walks to Stochastic Trajectories (2023.findings-acl)
Copied to clipboard
Mojtaba Nayyeri, Bo Xiong, Majid Mohammadi, Mst. Mahfuja Akter, Mirza Mohtashim Alam, Jens Lehmann, Steffen Staab
| Challenge: | Existing knowledge graph embeddings have problems expressing knowledge graphs because they model a specific relation r from a head h to tails by transitioning deterministically to exactly one other point in the embeddable space. |
| Approach: | They propose a framework that models relations between nodes by relation-specific, stochastic transitions. |
| Outcome: | The proposed framework is expressive and generic subsuming state-of-the-art models operating on low-dimensional manifolds. |
LogosKG: Hardware-Optimized Scalable and Interpretable Knowledge Graph Retrieval (2026.acl-long)
Copied to clipboard
He Cheng, Yifu Wu, Saksham Khatwani, Maya Kruse, Dmitriy Dligach, Timothy A. Miller, Majid Afshar, Yanjun Gao
| Challenge: | Existing systems struggle to balance efficiency, scalability, and interpretability. |
| Approach: | They propose a hardware-aligned framework that enables scalable and interpretable k-hop retrieval on large KGs. |
| Outcome: | The proposed framework scales to billion-edge graphs without loss of retrieval fidelity. |
Graph-to-Graph Transformer for Transition-based Dependency Parsing (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing models for conditioning on graphs and predicting graphs are weak, but they are effective for transition-based dependency parsing. |
| Approach: | They propose a Transformer architecture for conditioning on and predicting arbitrary graphs. |
| Outcome: | The proposed architecture outperforms the state-of-the-art in transition-based dependency parsing on English Penn Treebank and 13 languages of Universal Dependencies Treebanks. |
Storytelling from Structured Data and Knowledge Graphs : An NLG Perspective (P19-4)
Copied to clipboard
| Challenge: | tutorial aims to explain the basic concepts of translating structured data into natural language . Various solutions for structured data translation will be discussed . |
| Approach: | tutorial aims to cover foundational, methodological, and system development aspects of translating structured data into natural language . Various solutions starting from traditional rule based/heuristic driven and modern data-driven will be discussed . |
| Outcome: | The tutorial aims to convey challenges and nuances in structured data translation, data representation techniques, and domain adaptable solutions for translation of the data into natural language form. |
SEEK: Segmented Embedding of Knowledge Graphs (2020.acl-main)
Copied to clipboard
| Challenge: | Existing methods for knowledge graph embedding can not make a proper trade-off between the model complexity and the model expressiveness, which makes them far from satisfactory. |
| Approach: | They propose a lightweight modeling framework that can achieve highly competitive relational expressiveness without increasing the model complexity. |
| Outcome: | The proposed framework can achieve highly competitive relational expressiveness without increasing model complexity. |
Taxonomy-Driven Knowledge Graph Construction for Domain-Specific Scientific Applications (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for constructing domain-specific knowledge graphs neglect curated taxonomies and LLMs fail to extract KGs in specialized domains. |
| Approach: | They propose a taxonomy-driven framework for constructing domain-specific knowledge graphs . they use structured taxonomies, Large Language Models and Retrieval-Augmented Generation . |
| Outcome: | The proposed framework can be adapted for other specialized domains. |