Studies on the balancing, the minimal balancing, and the minimum balancing processes for social groups with planar and nonplanar graph structures

Katai, Osamu; Iwai, Shigehisa

doi:10.1016/0022-2496(78)90060-3

Cited by 31 publications

(13 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Here, the minimal balancing process is not necessarily unique. Katai and Iwai [15], [16] discussed how to derive a minimal balancing process. In a minimum balanced situation, we have max…”

Section: A Structural Balance and Minimal Balancing Processesmentioning

confidence: 99%

Collaborative filtering by sequential extraction of user-item clusters based on structural balancing approach

Honda

Notsu

Ichihashi

2009

2009 IEEE International Conference on Fuzzy Systems

View full text Add to dashboard Cite

This paper considers a new approach to useritem clustering for collaborative filtering problems that achieves personalized recommendation. When user-item relations are given by an alternative process, personalized recommendation is performed by finding user-item neighborhoods (co-clusters) from a rectangular relational data matrix, in which users and items have mutually positive relations. In the proposed approach, user-item clusters are extracted one by one in a sequential manner via a structural balancing technique, used in conjunction with the sequential fuzzy cluster extraction method.

show abstract

“…Here, the minimal balancing process is not necessarily unique. Katai and Iwai [15], [16] discussed how to derive a minimal balancing process. In a minimum balanced situation, we have max…”

Section: A Structural Balance and Minimal Balancing Processesmentioning

confidence: 99%

Collaborative filtering by sequential extraction of user-item clusters based on structural balancing approach

Honda

Notsu

Ichihashi

2009

2009 IEEE International Conference on Fuzzy Systems

View full text Add to dashboard Cite

show abstract

“…see Acharya [4]; Katai and Iwai [20,21]; Roberts [24]; Roberts and Xu [25]) and also because of their interesting connections with many classical mathematical systems (Zaslavsky [28]). …”

Section: Introductionmentioning

confidence: 99%

Characterization of Signed Graphs Whose Iterated Signed Line Graphs are Balanced or S-Consistent

Sinha

Acharya

2015

Bull. Malays. Math. Sci. Soc.

View full text Add to dashboard Cite

show abstract

“…The collection of all positive edges and the collection of all negative edges are denoted by E + (S) and E -(S), respectively. In social psychology, signed graphs have been used to model social situations (examples in [13], [14] and [9]). A signed graph in which all the edges are positive (negative) is called all-positive (all-negative) signed graph.…”

Section: Introductionmentioning

confidence: 99%

Forbidden Subgraph Characterizations of Extensions of Gallai Graph Operator to Signed Graph

Palathingal¹,

S²

2017

APAM

View full text Add to dashboard Cite

show abstract

Studies on the balancing, the minimal balancing, and the minimum balancing processes for social groups with planar and nonplanar graph structures

Cited by 31 publications

References 6 publications

Collaborative filtering by sequential extraction of user-item clusters based on structural balancing approach

Collaborative filtering by sequential extraction of user-item clusters based on structural balancing approach

Characterization of Signed Graphs Whose Iterated Signed Line Graphs are Balanced or S-Consistent

Forbidden Subgraph Characterizations of Extensions of Gallai Graph Operator to Signed Graph

Contact Info

Product

Resources

About