Path-based Features
Path-Based Features is a graph feature engineering method that derives node or graph representations by analyzing structural and semantic characteristics of paths—such as shortest, random, or contextual walks—within a graph, thereby distinguishing itself from node- or edge-centric approaches through its focus on relational sequences.
64
Publications
3.5K
Citations
215
Authors
106
Institutions
Publications per year
2017–2026
34
Parents
64
Co-author Relationship Prediction in Heterogeneous Bibliographic Networks
Yizhou Sun, Rick Barber, Manish Gupta et al. · 2011 · 449 citations
Discriminative reordering with Chinese grammatical relations features
Pi-Chuan Chang, Huihsin Tseng, Dan Jurafsky et al. · 2009 · 151 citations · Full text
1–5 of 64
215
3
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 215
106

University of Electronic Science and Technology of China
Chengdu, China
3 h-index
4 publications
228 citations
Xiamen University
Xiamen, China
2 h-index
6 publications
346 citations

Beijing University of Posts and Telecommunications
Beijing, China
2 h-index
4 publications
84 citations

Beihang University
Beijing, China
2 h-index
4 publications
43 citations
Stanford University
Stanford, United States
2 h-index
6 publications
2.5K citations
Technische Universität Braunschweig
Braunschweig, Germany
2 h-index
4 publications
86 citations
University of Washington
Seattle, United States
2 h-index
2 publications
146 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
3 publications
88 citations
1–8 of 106
Conference · 3 publications · 105 citations
3
h-index
Repository · 3 publications · 78 citations
3
h-index
Repository · 2 publications · 59 citations
2
h-index
1 publications · 19 citations
1
h-index
1 publications · 104 citations
1
h-index
1–5