Xiaoran Xu

Orcid: 0000-0003-4450-8757

According to our database1, Xiaoran Xu authored at least 19 papers between 2010 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A validation study on the factors affecting the practice modes of open peer review.
Scientometrics, January, 2023

2020
Distilling Structured Knowledge into Embeddings for Explainable and Accurate Recommendation.
Proceedings of the WSDM '20: The Thirteenth ACM International Conference on Web Search and Data Mining, 2020

Dynamically Pruned Message Passing Networks for Large-scale Knowledge Graph Reasoning.
Proceedings of the 8th International Conference on Learning Representations, 2020

2019
Neural Consciousness Flow.
CoRR, 2019

Knowledge-oriented Sentiment-level Embedding for Sentiment Classification.
Proceedings of the ACAI 2019: 2nd International Conference on Algorithms, 2019

2018
ShareJIT: JIT code cache sharing across processes and its practical implementation.
Proc. ACM Program. Lang., 2018

Modeling Attention Flow on Graphs.
CoRR, 2018

Backprop-Q: Generalized Backpropagation for Stochastic Computation Graphs.
CoRR, 2018

Hulu video recommendation: from relevance to reasoning.
Proceedings of the 12th ACM Conference on Recommender Systems, 2018

Efficient Characterization of Hidden Processor Memory Hierarchies.
Proceedings of the Computational Science - ICCS 2018, 2018

PAYJIT: space-optimal JIT compilation and its practical implementation.
Proceedings of the 27th International Conference on Compiler Construction, 2018

2016
A novel probabilistic clustering model for heterogeneous networks.
Mach. Learn., 2016

2015
Mining Top K Spread Sources for a Specific Topic and a Given Node.
IEEE Trans. Cybern., 2015

2014
GUI testing assisted by human knowledge: Random vs. functional.
J. Syst. Softw., 2014

Testing as an Investment.
Proceedings of the 26th International Conference on Software Engineering and Knowledge Engineering, 2014

2012
Fast mining erasable itemsets using NC_sets.
Expert Syst. Appl., 2012

2011
Mop: An Efficient Algorithm for Mining Frequent Pattern with Subtree Traversing.
Fundam. Informaticae, 2011

BibClus: A Clustering Algorithm of Bibliographic Networks by Message Passing on Center Linkage Structure.
Proceedings of the 11th IEEE International Conference on Data Mining, 2011

2010
An Efficient Algorithm for Mining Erasable Itemsets.
Proceedings of the Advanced Data Mining and Applications - 6th International Conference, 2010


  Loading...