ArnetMiner
From MaRDI portal
Cited in
(44)- LINE
- LSCP
- Meta-AAD
- TODS
- PLANC
- FastFDs
- TANE
- Decomposition-by-normalization (DBN): leveraging approximate functional dependencies for efficient CP and Tucker decompositions
- Graph sampling with applications to estimating the number of pattern embeddings and the parameters of a statistical relational model
- Actively learning to infer social ties
- Multi-source information fusion based heterogeneous network embedding
- HNS: hierarchical negative sampling for network representation learning
- MGAT: multi-view graph attention networks
- Network embedding: taxonomies, frameworks and applications
- Conditional t-SNE: more informative t-SNE embeddings
- Co-ranking for nodes, layers and timestamps in multilayer temporal networks
- Subjectively interesting connecting trees and forests
- SuLQ
- What distinguish one from its peers in social networks?
- Mining explainable local and global subgraph patterns with surprising densities
- Evaluating tacit knowledge diffusion with algebra matrix algorithm based social networks
- GraphGrep
- SING
- Temporal_Eigenvector_Centrality
- SpEagle
- GraRep
- EigenRank
- INLOCANDA
- A generalized approach for social network integration and analysis with privacy preservation
- MotifCut
- Type extension trees for feature construction and learning in relational domains
- Text mining in computational advertising
- metapath2vec
- HIN2Vec
- GE-SpMM
- NetSMF
- PTE
- ProNE
- GraphSAINT
- HeteSpaceyWalk
- MultiVis
- MSigDB
- Faster compression methods for a weighted graph using locality sensitive hashing
- Ranking by inspiration: a network science approach
This page was built for software: ArnetMiner
