Dissertation/ Thesis
View in EDS

Several Practical Models and Their Approximate Solutions in Social Networks

Bibliographic Details
Title: Several Practical Models and Their Approximate Solutions in Social Networks
Authors: Guo, Jianxiong
Contributors: Du, Ding-Zhu, Wu, Weili
Publication Year: 2021
Subject Terms: Sampling (Statistics) -- Computer programs, Online social networks, Combinatorial optimization, Approximation algorithms
Description: The online social platforms developed due to the popularity of the Internet and have become the mainstream way for daily communication as well as information spreading. The users and relationships between users in these social platforms can be abstracted by a social graph (social network). The most typical application in social networks is viral marketing, which takes the advantage of online advertisements to make information spread to more audiences in a short time. At the same time, we have to constrain the negative impact of misinformation spread. They can be formulated as combinatorial optimization problems in the directed graph, such as influence maximization, profit maximization, and rumor blocking. Influence spread can be characterized by different diffusion models. However, the existing models cannot portray the colorful real world. In this dissertation, we propose a series of new diffusion models, including a complementary products model, a multi-feature diffusion model, a k-hop collaborate game model, and an influence balancing model to adapt to some realistic applications in social networks, also study their related algorithmic problems. Because of their NP-hardness, we focus on designing efficient approximate algorithms. To overcome the #P-hardness of computing objective functions, we adopt the techniques of reverse influence sampling to improve efficiency without losing the approximation ratio.
Document Type: thesis
File Description: application/pdf
Language: English
Relation: https://hdl.handle.net/10735.1/9277
Availability: https://hdl.handle.net/10735.1/9277
Accession Number: edsbas.985F3E03
Database: BASE
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://hdl.handle.net/10735.1/9277#
    Name: EDS - BASE (ns324271)
    Category: fullText
    Text: View record from BASE
Header DbId: edsbas
DbLabel: BASE
An: edsbas.985F3E03
RelevancyScore: 758
AccessLevel: 3
PubType: Dissertation/ Thesis
PubTypeId: dissertation
PreciseRelevancyScore: 758.347900390625
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Several Practical Models and Their Approximate Solutions in Social Networks
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Guo%2C+Jianxiong%22">Guo, Jianxiong</searchLink>
– Name: Author
  Label: Contributors
  Group: Au
  Data: Du, Ding-Zhu<br />Wu, Weili
– Name: DatePubCY
  Label: Publication Year
  Group: Date
  Data: 2021
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Sampling+%28Statistics%29+--+Computer+programs%22">Sampling (Statistics) -- Computer programs</searchLink><br /><searchLink fieldCode="DE" term="%22Online+social+networks%22">Online social networks</searchLink><br /><searchLink fieldCode="DE" term="%22Combinatorial+optimization%22">Combinatorial optimization</searchLink><br /><searchLink fieldCode="DE" term="%22Approximation+algorithms%22">Approximation algorithms</searchLink>
– Name: Abstract
  Label: Description
  Group: Ab
  Data: The online social platforms developed due to the popularity of the Internet and have become the mainstream way for daily communication as well as information spreading. The users and relationships between users in these social platforms can be abstracted by a social graph (social network). The most typical application in social networks is viral marketing, which takes the advantage of online advertisements to make information spread to more audiences in a short time. At the same time, we have to constrain the negative impact of misinformation spread. They can be formulated as combinatorial optimization problems in the directed graph, such as influence maximization, profit maximization, and rumor blocking. Influence spread can be characterized by different diffusion models. However, the existing models cannot portray the colorful real world. In this dissertation, we propose a series of new diffusion models, including a complementary products model, a multi-feature diffusion model, a k-hop collaborate game model, and an influence balancing model to adapt to some realistic applications in social networks, also study their related algorithmic problems. Because of their NP-hardness, we focus on designing efficient approximate algorithms. To overcome the #P-hardness of computing objective functions, we adopt the techniques of reverse influence sampling to improve efficiency without losing the approximation ratio.
– Name: TypeDocument
  Label: Document Type
  Group: TypDoc
  Data: thesis
– Name: Format
  Label: File Description
  Group: SrcInfo
  Data: application/pdf
– Name: Language
  Label: Language
  Group: Lang
  Data: English
– Name: NoteTitleSource
  Label: Relation
  Group: SrcInfo
  Data: https://hdl.handle.net/10735.1/9277
– Name: URL
  Label: Availability
  Group: URL
  Data: https://hdl.handle.net/10735.1/9277
– Name: AN
  Label: Accession Number
  Group: ID
  Data: edsbas.985F3E03
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.985F3E03
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Text: English
    Subjects:
      – SubjectFull: Sampling (Statistics) -- Computer programs
        Type: general
      – SubjectFull: Online social networks
        Type: general
      – SubjectFull: Combinatorial optimization
        Type: general
      – SubjectFull: Approximation algorithms
        Type: general
    Titles:
      – TitleFull: Several Practical Models and Their Approximate Solutions in Social Networks
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Guo, Jianxiong
      – PersonEntity:
          Name:
            NameFull: Du, Ding-Zhu
      – PersonEntity:
          Name:
            NameFull: Wu, Weili
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2021
          Identifiers:
            – Type: issn-locals
              Value: edsbas
ResultId 1