Pith. sign in

REVIEW 4 major objections 5 minor 39 references

Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs

T0 review · 4 major / 5 minor · reviewed 2026-08-11 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A lightweight GNN encoder, ELISE, predicts link signs in signed bipartite graphs more accurately and far faster than prior GNN methods.

desk verdict Solid, practical signed-bipartite GNN with real efficiency gains; the accuracy edge over signed baselines is plausible but not statistically established. read the letter →

arxiv 2412.18720 v1 pith:3PLA6PYD submitted 2024-12-25 cs.LG

Gyeongmin Gu , Minseo Jeon , Hyun-Je Song , Jinhong Jung This is my paper · ORCID
classification cs.LG
keywords signedbipartitegraphslinksignpredictiongraphneuralnetworkspersonalizedpropagationlow-rankapproximationmessagepassingbalancetheoryrepresentationlearning
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper introduces ELISE, a graph-neural-network method for learning node embeddings in signed bipartite graphs—graphs whose edges run between two types of nodes and carry a positive or negative sign. Its central claim is that ELISE predicts the sign of unseen links more accurately than existing GNN-based approaches while training and running substantially faster, and that it can handle large graphs on which those approaches run out of memory. The method achieves this by replacing the naive message passing of prior work with two complementary encoders: signed personalized message passing, which injects each node's own features at every propagation step to avoid over-smoothing while respecting balance theory, and refined message passing on a low-rank approximation of the graph, which suppresses noisy interactions. A sympathetic reader would care because link sign prediction is the core task in applications such as recommendation, e-commerce trust, and peer review, and the paper's efficiency gains are what make the method usable on large real-world signed bipartite graphs.

What carries the argument

The central object is signed personalized message passing, an embedding-level analogue of the signed random walk with restart (SRWR). For each node type the model maintains positive and negative embedding channels; each layer propagates positive embeddings across positive edges and negative embeddings across negative edges (and the cross terms), then injects the node's own input features with ratio $c$ to keep representations distinguishable. The second mechanism is refined message passing: a truncated SVD of the row-wise normalized signed biadjacency matrices, stored once in a hash map and applied through the reordered product $U\Sigma(V^\top X)$, so message passing on the reconstructed low-rank graph costs $O(nkd)$ instead of $O(|U||V|d)$ and suppresses noisy edges. Together the two encoders deliver the paper's claimed $O(m+n)$ time and space complexity when rank, dimension, and depth are fixed.

What would settle it

Construct or find a signed bipartite dataset where the sign of edges is generated from high-rank structure, for example signs determined by per-node random vectors with no low-dimensional latent factor, then compare ELISE with its own variant that uses only the original-graph encoder: if the full model does not beat the variant, the low-rank assumption fails. The paper's own ablation tables provide the template for this test.

Watch

Extended reading notes

Core claim

ELISE's core claim is that a lightweight, edge-free encoder can outperform edge-augmenting GNNs on signed bipartite link sign prediction. Prior GNN methods for these graphs add edges between same-type nodes to encode balance theory, which bloats the graph and slows training; ELISE instead extends personalized propagation—the signed random walk with restart—to node embeddings, carrying positive and negative embedding channels across signed edges and adding a personalized-feature injection at each layer. This respects balance theory without adding edges and prevents embeddings from collapsing with depth. A second encoder runs the same signed propagation on a rank-k truncated SVD reconstruction of the signed biadjacency matrices, with the matrix multiplications reordered as $U(\Sigma(V^\top X))$ for efficiency, to denoise the graph and expose global structure. The final embedding concatenates both encoders' outputs, and the whole model trains with a single binary cross-entropy loss, no per-layer weight matrices, and no auxiliary losses. Experiments on four real-world graphs report higher AUC and Macro-F1 than existing signed-bipartite and unsigned-bipartite GNN baselines, with up to 162.8x faster inference on the largest dataset and with competitors failing from out-of-memory on the larger graphs.

Load-bearing premise

The method assumes that a truncated low-rank approximation of the signed biadjacency matrix keeps the structure that determines link signs and that whatever is cut off is mostly noise; if a dataset's sign information lives in the discarded tail of the singular spectrum, the refined encoder will hurt rather than help.

Editorial extensions

If this is right

  • On the four datasets tested, ELISE reports the best AUC and Macro-F1 among all compared GNN methods, with improvements over the best competitor of up to 2.64% in AUC and 4.96% in Macro-F1.
  • ELISE trains and infers faster than the baselines on every dataset, and it is the only method that completes on the two largest graphs under GPU memory limits.
  • Because no same-type edges are added and no per-layer weight matrices or auxiliary losses are used, preprocessing and message passing scale linearly in the number of edges and nodes ($O(m+n)$) with fixed hyperparameters.
  • The ablation study indicates that both encoders contribute: combining signed personalized message passing with refined message passing outperforms either alone on most datasets.
  • The signed personalized encoder keeps performance stable as the number of layers grows, whereas the edge-augmenting baseline's accuracy drops, evidence that over-smoothing is mitigated.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The low-rank refinement suggests a testable general principle: for sparse signed bipartite graphs, the sign-relevant signal often sits in a low-dimensional subspace, so truncated SVD acts as a denoiser; applying the same two-channel personalized propagation to other signed graph families, such as signed directed bipartite graphs, is a natural next step the paper does not discuss.
  • The method's speed is what unlocks scale: since signed-bipartite baselines run out of memory on graphs with millions of edges, ELISE-type encoders could enable sign prediction on much larger e-commerce and review platforms, though the paper only demonstrates four datasets.
  • The injection ratio $c$ and rank ratio $r$ interact: $c=0.15$ and small $r$ performed best on the tested graphs, but a dataset whose sign signal is spread across many singular directions would likely need a larger $r$; this trade-off is a testable hyperparameter hypothesis, not a claim the paper makes.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 5 minor

Summary. The paper proposes ELISE, a GNN-based method for representation learning in signed bipartite graphs, addressing link sign prediction. It contributes two encoders: signed personalized message passing, which extends signed random walk with restart to embedding propagation on the signed bipartite graph without adding edges, and refined message passing, which performs the same propagation on a low-rank SVD approximation of the signed biadjacency matrices. The final node representations are the concatenation of the two encoders' outputs, and link signs are predicted with a two-layer MLP on the concatenated embeddings. The paper also provides time and space complexity analyses, claiming O(m+n) complexity under fixed hyperparameters. The experimental section reports link sign prediction results on four real-world datasets, an ablation study, hyperparameter sensitivity analysis, and efficiency comparisons against SBGNN, SBGCL, LightGCN, and LightGCL.

Significance. If the empirical claim is established, ELISE would be a useful and lightweight alternative to existing signed-bipartite GNNs: it avoids adding same-type edges, requires no per-layer weight matrices or auxiliary losses, and provides a simple, theoretically linear-time message-passing framework. The complexity analysis is transparent, and the method is evaluated on publicly available datasets with standard baselines, which supports reproducibility. However, the central 'significantly outperforms competitors' claim is not yet supported by the reported statistics, because on two of the four datasets the margins over the best baselines are within one standard deviation, and on the two largest datasets the main signed-bipartite baselines fail due to memory limitations. The methodological novelty is moderate, but the contributions are clearly presented and the proposed components are sensible.

major comments (4)
  1. [§5.2, Table 3] The headline claim that ELISE 'significantly outperforms' competitors is not supported by the reported statistics: on Review, ELISE AUC is 0.7106±0.0424 versus SBGCL's 0.6960±0.0525, and on Bonanza, ELISE AUC is 0.6838±0.0198 versus LightGCL's 0.6662±0.0226. In both cases the gap is smaller than the reported standard deviation, and no significance tests are provided. Please report paired significance tests (e.g., paired t-test or Wilcoxon signed-rank test over the five seeds) or confidence intervals, and adjust the abstract and introduction wording accordingly.
  2. [§5.2, Table 3] The signed-bipartite competitors SBGNN and SBGCL run out of memory on the two largest datasets (ML-1M and Amazon-DM), except for SBGNN on Amazon-DM. As a result, on ML-1M and Amazon-DM the comparison against the state-of-the-art signed-bipartite GNNs is absent, and the 13.66% AUC improvement on ML-1M is measured against unsigned LightGCL rather than a signed-bipartite baseline. The claimed state of the art over signed-bipartite methods therefore rests on Review and Bonanza, where the margins are statistically fragile. Please attempt memory-efficient runs of these baselines (e.g., CPU execution, edge sampling, or mini-batch training), or, if this is infeasible with the original implementations, state this limitation explicitly and qualify the claim.
  3. [§4.2, Eq. (2)] Equation (2) contains an apparent typo: the update for the negative embedding M_V^{(l)} includes the injection term c·x_U, whereas the surrounding text states that the initial features X_V are injected, and the corresponding update for M_U in Eq. (3) has no injection term. If this is not a typo but a deliberate design, the asymmetry needs a justification. If it is a typo, please correct it and re-check the associated derivations and algorithm listings. Equation (8) also contains unmatched parentheses after RMP_k calls.
  4. [§5.4, Table 5] The ablation does not uniformly support the claim that jointly learning both components is beneficial: on Bonanza, ELISE-R (without refined message passing) achieves test AUC 0.7235±0.0257, while full ELISE achieves 0.6838±0.0198. The paper attributes this to a validation-test distribution gap, but no evidence is provided for that explanation. Please report the selected hyperparameters for each variant on each dataset and consider a nested model-selection protocol so that the component-wise comparison is not confounded by hyperparameter choice.
minor comments (5)
  1. [Table 3] The Amazon-DM Micro-F1 entry for ELISE is reported as 0.9802±0.9802, which appears to be a typo in the standard deviation; please verify and correct.
  2. [Table 2] The Bonanza negative-edge percentage is written as '0...2%'; this should presumably be '2.0%' (738/36,543).
  3. [§5.5, Figure 3] The text refers to the injection-ratio panel as Figure 3(a), but it is actually panel (b); please correct the cross-reference. The caption also labels the panels ambiguously.
  4. [Algorithms 2 and 3] The title of Algorithm 2 contains a typo: 'Singed Personalized Message Passing' should be 'Signed Personalized Message Passing'.
  5. [References] Reference [15] appears to be a duplicate of reference [14] (both cite the SDGNN paper); the source of the Review dataset should be cited explicitly or with a correct reference.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the derivation is a standard empirical pipeline and the cited prior work is used as algorithmic building blocks, not as proof of the paper's claims.

full rationale

ELISE's construction is self-contained in the sense that its two encoders are defined directly by Equations (2)-(3) and (7)-(8) as concrete message-passing updates on the input signed bipartite graph and its truncated-SVD reconstruction. The claimed contributions are empirical: improved AUC/F1 and runtime relative to SBGNN, SBGCL, LightGCN, and LightGCL, evaluated on held-out test edges with standard hyperparameter selection on validation. No fitted parameter is renamed as a prediction: the model parameters are trained with a BCE loss on the training split (Eq. 13-14), and the rank ratio, injection ratio, and layer count are tuned on validation. The low-rank refined graph is a data transformation of the same graph, but that is not circular because the evaluation uses held-out edges and the low-rank approximation does not encode the test labels. The self-citations (SRWR [18] as the basis for signed propagation, and randomized SVD / Zoom-SVD [8,16] for efficiency) are load-bearing only as algorithmic building blocks with independent implementations; they are not invoked to establish the paper's empirical claims. There is no uniqueness theorem or ansatz imported from the authors' prior work that forces the architecture. Statistical concerns about significance testing and missing baselines on large datasets are correctness/evaluation issues, not circularity. The manuscript's own remark that ELISE-R beats ELISE on Bonanza AUC is an observed anomaly, not a circular step.

Assumptions & free parameters 6 free parameters · 4 assumptions · 0 invented entities

ELISE introduces no new entities. Its claims rest on hyperparameters tuned on validation and on domain assumptions that butterfly-based balance propagation and SVD denoising capture signal relevant to link sign prediction.

free parameters (6)
  • injection ratio c = tuned per dataset from {0.01, 0.02, 0.15, 0.45, 0.75, 1.0}
    Controls the strength of personalized feature injection in Equations (2), (3), (7), and (8).
  • target rank ratio r = tuned per dataset from {0.05, 0.1, 0.2, 0.3, 0.4, 0.5}
    Sets the truncated SVD rank k = min(|U|,|V|)*r for the refined graph encoder.
  • number of layers L = tuned per dataset from {0,...,5}
    Number of propagation steps in both encoders.
  • embedding dimension d = 32
    Fixed final representation dimension in Section 5.1.
  • weight decay lambda_reg = 1e-5
    L2 regularization strength, a standard training hyperparameter.
  • layer aggregation weights alpha_l and alpha_hat_l = 1/(L+1) uniformly
    Set uniformly as in LightGCN to keep the model lightweight; not fitted to data.
assumptions (4)
  • domain assumption Balance theory extends to signed bipartite graphs through signed butterfly patterns, where balanced 4-cycles are more frequent than unbalanced ones.
    This extension, attributed to Derr et al. [5], justifies the sign-flipping message-passing rules in Equations (2) and (3).
  • domain assumption A low-rank (truncated SVD) approximation of the semi-normalized signed biadjacency matrices removes noisy interactions while preserving global structure relevant to link sign prediction.
    Used in Section 4.3 to build the refined graph; supported only by empirical ablations, not by theory.
  • domain assumption Real-world signed bipartite graphs are extremely sparse, so m = O(n) edges for n nodes.
    Used in Section 4.5 to conclude linear O(n) time complexity.
  • standard math The signed random walk with restart recurrence of Jung et al. satisfies balance theory and extends to embedding propagation.
    The personalized propagation backbone in Equation (1) is a published result; the paper extends it to node embeddings.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs." pith.science (2026). https://pith.science/paper/3PLA6PYD

@misc{pith2026241218720,
  author       = {Pith},
  title        = {Pith review of: Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/3PLA6PYD}},
  note         = {Machine review of arXiv:2412.18720}
}
read the original abstract

How can we effectively and efficiently learn node representations in signed bipartite graphs? A signed bipartite graph is a graph consisting of two nodes sets where nodes of different types are positively or negative connected, and it has been extensively used to model various real-world relationships such as e-commerce, etc. To analyze such a graph, previous studies have focused on designing methods for learning node representations using graph neural networks. In particular, these methods insert edges between nodes of the same type based on balance theory, enabling them to leverage augmented structures in their learning. However, the existing methods rely on a naive message passing design, which is prone to over-smoothing and susceptible to noisy interactions in real-world graphs. Furthermore, they suffer from computational inefficiency due to their heavy design and the significant increase in the number of added edges. In this paper, we propose ELISE, an effective and lightweight GNN-based approach for learning signed bipartite graphs. We first extend personalized propagation to a signed bipartite graph, incorporating signed edges during message passing. This extension adheres to balance theory without introducing additional edges, mitigating the over-smoothing issue and enhancing representation power. We then jointly learn node embeddings on a low-rank approximation of the signed bipartite graph, which reduces potential noise and emphasizes its global structure, further improving expressiveness without significant loss of efficiency. We encapsulate these ideas into ELISE, designing it to be lightweight, unlike the previous methods that add too many edges and cause inefficiency. Through extensive experiments on real-world signed bipartite graphs, we demonstrate that ELISE outperforms its competitors for predicting link signs while providing faster training and inference time.

Figures

Figures reproduced from arXiv: 2412.18720 by the authors.

Figure 1
Figure 1. Overall architecture of our proposed method [PITH_FULL_IMAGE:figures/full_fig_p005_1.png] view at source ↗
Figure 2
Figure 2. Running time comparison of ELISE with its competitors, SBGNN and SBGCL, in the inference and training phases, using GPU and CPU, respectively. Our method processes all datasets successfully and provides the fastest speed among the tested methods [PITH_FULL_IMAGE:figures/full_fig_p014_2.png] view at source ↗
Figure 3
Figure 3. Effect of hyperparameters of ELISE where (a) r is the rank ratio, (b) c is the injection ratio of personalized features, and (c) L is the number of layers. individually, but they exhibit a synergistic effect when signed personalized and refined message passing are jointly considered. For the Bonanza dataset, ELISE-R achieves higher test accuracy in AUC than ELISE, likely due to the gap between validation and test di… view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: Effect of the number L of layers on ELISE, ELISE-R, and SBGNN for the Amazon-DM dataset, where ELISE-R is a variant of ELISE without refined message passing (i.e., it performs only signed personalized message passing). Compared to SBGNN, our approaches show more robust…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

39 extracted references · 37 canonical work pages

  1. [1]

    Accessed: September 20, 2024

    Bonanza, 2024. Accessed: September 20, 2024

    work page 2024

  2. [2]

    Lightgcl: Simple yet effective graph contrastive learning for recommendation

    Xuheng Cai, Chao Huang, Lianghao Xia, and Xubin Ren. Lightgcl: Simple yet effective graph contrastive learning for recommendation. InThe Eleventh International Conference on Learning Representations, ICLR 2023, Kigali, Rwanda, May 1-5, 2023. OpenReview.net, 2023

    2023

  3. [3]

    Structural balance: a generalization of heider’s theory.Psychological review, 63(5):277, 1956

    Dorwin Cartwright and Frank Harary. Structural balance: a generalization of heider’s theory.Psychological review, 63(5):277, 1956

    work page 1956

  4. [4]

    Random walk with restart on hypergraphs: fast computation and an application to anomaly detection.Data Min

    Jaewan Chun, Geon Lee, Kijung Shin, and Jinhong Jung. Random walk with restart on hypergraphs: fast computation and an application to anomaly detection.Data Min. Knowl. Discov., 38(3):1222–1257, 2024

    work page 2024

  5. [5]

    Balance in signed bipartite networks

    Tyler Derr, Cassidy Johnson, Yi Chang, and Jiliang Tang. Balance in signed bipartite networks. In Wenwu Zhu, Dacheng Tao, Xueqi Cheng, Peng Cui, Elke A. Rundensteiner, David Carmel, Qi He, and Jeffrey Xu Yu, editors, Proceedings of the 28th ACM International Conference on Information and Knowledge Management, CIKM 2019, Beijing, China, November 3-7, 2019,...

    work page 2019

  6. [6]

    Signed graph convolutional networks

    Tyler Derr, Yao Ma, and Jiliang Tang. Signed graph convolutional networks. InIEEE International Conference on Data Mining, ICDM 2018, Singapore, November 17-20, 2018, pages 929–934. IEEE Computer Society, 2018

    work page 2018

  7. [7]

    node2vec: Scalable feature learning for networks

    Aditya Grover and Jure Leskovec. node2vec: Scalable feature learning for networks. In Balaji Krishnapuram, Mohak Shah, Alexander J. Smola, Charu C. Aggarwal, Dou Shen, and Rajeev Rastogi, editors,Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, CA, USA, August 13-17, 2016, pages 855–864. ACM, 2016

    work page 2016

  8. [8]

    Nathan Halko, Per-Gunnar Martinsson, and Joel A. Tropp. Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions.SIAM Rev., 53(2):217–288, 2011

    work page 2011

Show all 39 references
  1. [9]

    Maxwell Harper and Joseph A

    F. Maxwell Harper and Joseph A. Konstan. The movielens datasets: History and context.ACM Trans. Interact. Intell. Syst., 5(4):19:1–19:19, 2016

    2016

  2. [10]

    Ruining He and Julian J. McAuley. Ups and downs: Modeling the visual evolution of fashion trends with one-class collaborative filtering. In Jacqueline Bourdeau, Jim Hendler, Roger Nkambou, Ian Horrocks, and Ben Y. Zhao, editors, Proceedings of the 25th International Conference...

    2016

  3. [11]

    Lightgcn: Simplifying and powering graph convolution network for recommendation

    Xiangnan He, Kuan Deng, Xiang Wang, Yan Li, Yong-Dong Zhang, and Meng Wang. Lightgcn: Simplifying and powering graph convolution network for recommendation. In Jimmy X. Huang, Yi Chang, Xueqi Cheng, Jaap Kamps, Vanessa Murdock, Ji-Rong Wen, and Yiqun Liu, editors,Proceedings o...

    2020

  4. [12]

    Signed bipartite graph neural networks

    Junjie Huang, Huawei Shen, Qi Cao, Shuchang Tao, and Xueqi Cheng. Signed bipartite graph neural networks. In CIKM ’21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1 - 5, 2021, pages 740–749. ACM, 2021

    2021

  5. [13]

    Signed graph attention networks

    Junjie Huang, Huawei Shen, Liang Hou, and Xueqi Cheng. Signed graph attention networks. In Igor V. Tetko, Vera Kurková, Pavel Karpov, and Fabian J. Theis, editors,Artificial Neural Networks and Machine Learning - ICANN 2019 - 28th International Conference on Artificial Neural ...

    2019

  6. [15]

    SDGNN: learning node representation for signed directed networks

    Junjie Huang, Huawei Shen, Liang Hou, and Xueqi Cheng. SDGNN: learning node representation for signed directed networks. InThirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Confer- ence on Innovative Applications of Artificial Intelligence, IAAI ...

    2021

  7. [16]

    Zoom-svd: Fast and memory efficient method for extracting key patterns in an arbitrary time range

    Jun-Gi Jang, Dongjin Choi, Jinhong Jung, and U Kang. Zoom-svd: Fast and memory efficient method for extracting key patterns in an arbitrary time range. InProceedings of the 27th ACM International Conference on Information and Knowledge Management, CIKM 2018, Torino, Italy, Oct...

    2018

  8. [17]

    Random walk-based ranking in signed social networks: model and algorithms

    Jinhong Jung, Woojeong Jin, and U Kang. Random walk-based ranking in signed social networks: model and algorithms. Knowl. Inf. Syst., 62(2):571–610, 2020

    2020

  9. [18]

    Personalized ranking in signed networks using signed random walk with restart

    Jinhong Jung, Woojeong Jin, Lee Sael, and U Kang. Personalized ranking in signed networks using signed random walk with restart. InIEEE 16th International Conference on Data Mining, ICDM 2016, December 12-15, 2016, Barcelona, Spain, pages 973–978. IEEE Computer Society, 2016

    2016

  10. [19]

    Bepi: Fast and memory-efficient method for billion-scale random walk with restart

    Jinhong Jung, Namyong Park, Lee Sael, and U Kang. Bepi: Fast and memory-efficient method for billion-scale random walk with restart. InProceedings of the 2017 ACM International Conference on Management of Data, SIGMOD Conference 2017, Chicago, IL, USA, May 14-19, 2017, pages 7...

    2017

  11. [20]

    Fast and accurate pseudoinverse with sparse matrix reordering and incremental approach

    Jinhong Jung and Lee Sael. Fast and accurate pseudoinverse with sparse matrix reordering and incremental approach. Mach. Learn., 109(12):2333–2347, 2020

    2020

  12. [21]

    Signed graph diffusion network.CoRR, abs/2012.14191, 2020

    Jinhong Jung, Jaemin Yoo, and U Kang. Signed graph diffusion network.CoRR, abs/2012.14191, 2020

    2012 arXiv

  13. [22]

    SIDE: representation learning in signed directed networks

    Junghwan Kim, Haekyu Park, Ji-Eun Lee, and U Kang. SIDE: representation learning in signed directed networks. In Proceedings of the 2018 World Wide Web Conference on World Wide Web, WWW 2018, Lyon, France, April 23-27, 2018, pages 509–518. ACM, 2018

    2018

  14. [23]

    Learning disentangled representations in signed directed graphs without social assumptions

    Geonwoo Ko and Jinhong Jung. Learning disentangled representations in signed directed graphs without social assumptions. Inf. Sci., 665:120373, 2024

    2024

  15. [24]

    Universal graph contrastive learning with a novel laplacian perturbation

    Taewook Ko, Yoonhyuk Choi, and Chong-Kwon Kim. Universal graph contrastive learning with a novel laplacian perturbation. In Proceedings of the Thirty-Ninth Conference on Uncertainty in Artificial Intelligence, volume 216, pages 1098–1108, 2023

    2023

  16. [25]

    Time-aware random walk diffusion to improve dynamic graph learning

    Jong-whi Lee and Jinhong Jung. Time-aware random walk diffusion to improve dynamic graph learning. In Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symp...

    2023

  17. [26]

    Mule: Multi-grained graph learning for multi- behavior recommendation

    Seunghan Lee, Geonwoo Ko, Hyun-Je Song, and Jinhong Jung. Mule: Multi-grained graph learning for multi- behavior recommendation. In Proceedings of the 33rd ACM International Conference on Information and Knowledge Management, CIKM 2024, Boise, ID, USA, October 21-25, 2024, pag...

    2024

  18. [27]

    Deeper insights into graph convolutional networks for semi-supervised learning

    Qimai Li, Zhichao Han, and Xiao-Ming Wu. Deeper insights into graph convolutional networks for semi-supervised learning. In Sheila A. McIlraith and Kilian Q. Weinberger, editors,Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, (AAAI-18), the 30th in...

    2018

  19. [28]

    Learning signed network embedding via graph attention

    Yu Li, Yuan Tian, Jiawei Zhang, and Yi Chang. Learning signed network embedding via graph attention. InThe Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, The Thirty-Second Innovative Applications of Artificial Intelligence Conference, IAAI 2020, The Tenth...

    2020

  20. [29]

    McAuley, Christopher Targett, Qinfeng Shi, and Anton van den Hengel

    Julian J. McAuley, Christopher Targett, Qinfeng Shi, and Anton van den Hengel. Image-based recommendations on styles and substitutes. In Ricardo Baeza-Yates, Mounia Lalmas, Alistair Moffat, and Berthier A. Ribeiro- Neto, editors,Proceedings of the 38th International ACM SIGIR ...

    2015

  21. [30]

    A noise-filtering method for link prediction in complex networks

    Bo Ouyang, Lurong Jiang, and Zhaosheng Teng. A noise-filtering method for link prediction in complex networks. PloS one, 11(1):e0146925, 2016

    2016

  22. [31]

    The pagerank citation ranking: Bringing order to the web

    Lawrence Page. The pagerank citation ranking: Bringing order to the web. Technical report, Technical Report, 1999

    1999

  23. [32]

    A comparative study of matrix factorization and random walk with restart in recommender systems

    Haekyu Park, Jinhong Jung, and U Kang. A comparative study of matrix factorization and random walk with restart in recommender systems. In2017 IEEE International Conference on Big Data (IEEE BigData 2017), Boston, MA, USA, December 11-14, 2017, pages 756–765. IEEE Computer Soc...

    2017

  24. [33]

    Clustered low rank approximation of graphs in information science applications

    Berkant Savas and Inderjit S Dhillon. Clustered low rank approximation of graphs in information science applications. In Proceedings of the 2011 SIAM International Conference on Data Mining, pages 164–175. SIAM, 2011

    2011

  25. [34]

    The graph neural network model

    Franco Scarselli, Marco Gori, Ah Chung Tsoi, Markus Hagenbuchner, and Gabriele Monfardini. The graph neural network model. IEEE Trans. Neural Networks, 20(1):61–80, 2009. 19

    2009

  26. [35]

    BEAR: block elimination approach for random walk with restart on large graphs

    Kijung Shin, Jinhong Jung, Lee Sael, and U Kang. BEAR: block elimination approach for random walk with restart on large graphs. InProceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31 - June 4, 2015, pages 157...

    2015

  27. [36]

    SGCL: contrastive representation learning for signed graphs

    Lin Shu, Erxin Du, Yaomin Chang, Chuan Chen, Zibin Zheng, Xingxing Xing, and Shaofeng Shen. SGCL: contrastive representation learning for signed graphs. InCIKM ’21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Austra...

    2021

  28. [37]

    Link prediction with signed latent factors in signed social networks

    Pinghua Xu, Wenbin Hu, Jia Wu, and Bo Du. Link prediction with signed latent factors in signed social networks. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD 2019, Anchorage, AK, USA, August 4-8, 2019, pages 1046–1054....

    2019

  29. [38]

    Dual-branch density ratio estimation for signed network embedding

    Pinghua Xu, Yibing Zhan, Liu Liu, Baosheng Yu, Bo Du, Jia Wu, and Wenbin Hu. Dual-branch density ratio estimation for signed network embedding. InWWW ’22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25 - 29, 2022, pages 1651–1662. ACM, 2022

    2022

  30. [39]

    Graph contrastive learning with augmentations

    Yuning You, Tianlong Chen, Yongduo Sui, Ting Chen, Zhangyang Wang, and Yang Shen. Graph contrastive learning with augmentations. InAdvances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, December 6-12...

    2020

  31. [40]

    Contrastive learning for signed bipartite graphs

    Zeyu Zhang, Jiamou Liu, Kaiqi Zhao, Song Yang, Xianda Zheng, and Yifei Wang. Contrastive learning for signed bipartite graphs. InProceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2023, Taipei, Taiwan, July 23...

    2023

Pith tools

Reviewed August 11, 2026 · model on record in the stance chip above.