View in EDS HTML Full Text PDF Full Text

Efficient stable community search in temporal signed graphs.

Saved in:
Bibliographic Details
Title: Efficient stable community search in temporal signed graphs.
Authors: Chen, Jinyi1 (AUTHOR) chenjinyi@stumail.neu.edu.cn, Xin, Junchang1 (AUTHOR) xinjunchang@mail.neu.edu.cn, Choudhury, Farhana2 (AUTHOR) farhana.choudhury@unimelb.edu.au, Zhou, Keqi1 (AUTHOR) zhoukeqi@stumail.neu.edu.cn, Wang, Zhiqiong3 (AUTHOR) wangzq@bmie.neu.edu.cn
Source: Knowledge & Information Systems. Jul2025, Vol. 67 Issue 7, p5619-5649. 31p.
Subjects: Intersection graph theory, Systems theory, Information storage & retrieval systems, Problem solving, Triangles
Abstract: Signed graphs are commonly used to model two opposite relationships between different entities, and finding communities in them has gained much attention. However, previous studies have mainly focused on the structural cohesiveness or robustness of communities in static signed graphs and have not considered the temporal information. To fill this gap, we propose a novel stable span community (SSC) model in temporal signed graphs. This model integrates the desirable properties of the k-core model for cohesiveness measurement and the balanced triangle model for robustness measurement, ensuring a seamless transition in both cohesive and robust structural continuity in temporal signed graphs. Following this, we present the SSC search problem in temporal signed graphs and prove it is NP-hard. To solve this problem, we develop a greedy algorithm by leveraging novel bound pruning techniques and search methods to explore the stable community in the intersection graph over a fixed time sub-interval. Furthermore, we employ an interval-pruning technique to elegantly extend this method to temporal signed graphs, significantly enhancing search efficiency for stable span communities within a query time interval. We conduct extensive experiments on real-world datasets to demonstrate the efficiency and effectiveness of our model and algorithms. [ABSTRACT FROM AUTHOR]
Copyright of Knowledge & Information Systems is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: egs
DbLabel: Engineering Source
An: 185966689
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Efficient stable community search in temporal signed graphs.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Chen%2C+Jinyi%22">Chen, Jinyi</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> chenjinyi@stumail.neu.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Xin%2C+Junchang%22">Xin, Junchang</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> xinjunchang@mail.neu.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Choudhury%2C+Farhana%22">Choudhury, Farhana</searchLink><relatesTo>2</relatesTo> (AUTHOR)<i> farhana.choudhury@unimelb.edu.au</i><br /><searchLink fieldCode="AR" term="%22Zhou%2C+Keqi%22">Zhou, Keqi</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> zhoukeqi@stumail.neu.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Wang%2C+Zhiqiong%22">Wang, Zhiqiong</searchLink><relatesTo>3</relatesTo> (AUTHOR)<i> wangzq@bmie.neu.edu.cn</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Knowledge+%26+Information+Systems%22">Knowledge & Information Systems</searchLink>. Jul2025, Vol. 67 Issue 7, p5619-5649. 31p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Intersection+graph+theory%22">Intersection graph theory</searchLink><br /><searchLink fieldCode="DE" term="%22Systems+theory%22">Systems theory</searchLink><br /><searchLink fieldCode="DE" term="%22Information+storage+%26+retrieval+systems%22">Information storage & retrieval systems</searchLink><br /><searchLink fieldCode="DE" term="%22Problem+solving%22">Problem solving</searchLink><br /><searchLink fieldCode="DE" term="%22Triangles%22">Triangles</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Signed graphs are commonly used to model two opposite relationships between different entities, and finding communities in them has gained much attention. However, previous studies have mainly focused on the structural cohesiveness or robustness of communities in static signed graphs and have not considered the temporal information. To fill this gap, we propose a novel stable span community (SSC) model in temporal signed graphs. This model integrates the desirable properties of the k-core model for cohesiveness measurement and the balanced triangle model for robustness measurement, ensuring a seamless transition in both cohesive and robust structural continuity in temporal signed graphs. Following this, we present the SSC search problem in temporal signed graphs and prove it is NP-hard. To solve this problem, we develop a greedy algorithm by leveraging novel bound pruning techniques and search methods to explore the stable community in the intersection graph over a fixed time sub-interval. Furthermore, we employ an interval-pruning technique to elegantly extend this method to temporal signed graphs, significantly enhancing search efficiency for stable span communities within a query time interval. We conduct extensive experiments on real-world datasets to demonstrate the efficiency and effectiveness of our model and algorithms. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Knowledge & Information Systems is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=185966689
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s10115-025-02396-4
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 31
        StartPage: 5619
    Subjects:
      – SubjectFull: Intersection graph theory
        Type: general
      – SubjectFull: Systems theory
        Type: general
      – SubjectFull: Information storage & retrieval systems
        Type: general
      – SubjectFull: Problem solving
        Type: general
      – SubjectFull: Triangles
        Type: general
    Titles:
      – TitleFull: Efficient stable community search in temporal signed graphs.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Chen, Jinyi
      – PersonEntity:
          Name:
            NameFull: Xin, Junchang
      – PersonEntity:
          Name:
            NameFull: Choudhury, Farhana
      – PersonEntity:
          Name:
            NameFull: Zhou, Keqi
      – PersonEntity:
          Name:
            NameFull: Wang, Zhiqiong
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 07
              Text: Jul2025
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-print
              Value: 02191377
          Numbering:
            – Type: volume
              Value: 67
            – Type: issue
              Value: 7
          Titles:
            – TitleFull: Knowledge & Information Systems
              Type: main
ResultId 1