J
Jianxin Li
Researcher at Deakin University
Publications - 167
Citations - 3096
Jianxin Li is an academic researcher from Deakin University. The author has contributed to research in topics: Computer science & XML. The author has an hindex of 21, co-authored 148 publications receiving 1664 citations. Previous affiliations of Jianxin Li include University of Western Australia & RMIT University.
Papers
More filters
Journal ArticleDOI
Community-diversified influence maximization in social networks
TL;DR: This work proposes a metric to measure the community-diversified influence and addresses a series of computational challenges that have been verified through extensive experimental studies on five real-world social network datasets.
Journal ArticleDOI
Target-aware Holistic Influence Maximization in Spatial Social Networks
TL;DR: This work devise a novel holistic influence diffusion model that takes into account both cyber and physical user interactions in an effective and practical way and formulate a new problem of holistic influence maximization, denoted as HIM query, for targeted advertisements in a spatial social network.
Journal ArticleDOI
Exploring Human Mobility Patterns in Urban Scenarios: A Trajectory Data Perspective
TL;DR: An integrated computing method to rescale heterogeneous traffic trajectory data, which leverages MLE and BIC is proposed and several important human mobility patterns are obtained and quite a few interesting phenomena are discovered, which lay a solid foundation for future research.
Journal ArticleDOI
JKT: A joint graph convolutional network based Deep Knowledge Tracing
TL;DR: In JKT, it is not only possible to establish connections between exercises under cross-concepts, but also to help capture high-level semantic information and increase the model’s interpretability.
Proceedings ArticleDOI
Finding maximal k-edge-connected subgraphs from a large graph
TL;DR: This paper proposes three major techniques: vertex reduction, edge reduction and cut pruning that are applied on top of the basic approach to find maximal k-edge-connected subgraphs from a large graph.