Node classification over bipartite graphs through projection
From MaRDI portal
Publication:2051228
Recommendations
- Projection-based link prediction in a bipartite network
- Exploiting the structure of bipartite graphs for algebraic and spectral graph theory applications
- Predicting potential links by using strengthened projections in evolving bipartite networks
- Time-aware link prediction based on strengthened projection in bipartite networks
- Similarity-based local community detection for bipartite networks
Cites work
- A Consistent Extension of Condorcet’s Election Principle
- Comprehensible credit scoring models using rule extraction from support vector machines
- Distribution-based aggregation for relational learning with identifier attributes
- scientific article; zbMATH DE number 3173999 (Why is no real title available?)
- scientific article; zbMATH DE number 5296741 (Why is no real title available?)
- LIBLINEAR: a library for large linear classification
- Small worlds among interlocking directors: network structure and distance in bipartite graphs
- Statistical comparisons of classifiers over multiple data sets
- Statistical distributions.
Cited in
(2)
This page was built for publication: Node classification over bipartite graphs through projection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2051228)