Non-submodular model for group profit maximization problem in social networks

In social networks, there exist many kinds of groups in which people may have the same interests, hobbies, or political orientation. Sometimes, group decisions are made by simply majority, which means that most of the users in this group reach an agreement, such as US Presidential Elections. A group...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computational social networks Ročník 8; číslo 1
Hlavní autori:	Zhu, Jianming, Ghosh, Smita, Wu, Weili, Gao, Chuangen
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cham Springer International Publishing 07.01.2021 Springer Nature B.V
Predmet:	Algorithms Data-driven Science Database Management Election results Elections Industrial and Production Engineering Industrial Organization Lower bounds Mathematical Models of Cognitive Processes and Neural Networks Mathematics Mathematics and Statistics Maximization Media Sociology Modeling and Theory Building Optimization Presidential elections Profit maximization Social networks Upper bounds Group profit maximization Social networks Submodular–modular algorithm Non-submodular
ISSN:	2197-4314, 2197-4314
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!