Zobrazeno 1 - 10
of 16
pro vyhledávání: '"sahar Kianian"'
Autor:
sahar Kianian, saeed Farzi
Publikováno v:
Computer and Knowledge Engineering, Vol 2, Iss 2, Pp 19-28 (2020)
Given the financial crises in the world, one of the most important issues of banking industry is the assessment of customers' credit to distinguish bad credit customers from good credit customers. The problem of customer credit risk assessment is a b
Externí odkaz:
https://doaj.org/article/71dab646f1394ad696c0b98f8a7d0ceb
Autor:
Zahra Aghaee, Sahar Kianian
Publikováno v:
SN Applied Sciences. 2
The influence maximization problem in social networks is an optimization problem in viral marketing. This problem is concerned with identifying a certain number of people with the most influence in the social network level. Considering the NP-hard of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d8935104c01b26ba46d2c9a49e172299
https://doi.org/10.1007/s42452-020-03812-w
https://doi.org/10.1007/s42452-020-03812-w
Autor:
Sahar Kianian, Zahra Aghaee
Publikováno v:
Social Network Analysis and Mining. 10
Word-of-Mouth promotion is among the effective methods of marketing and is highly regarded by many commercial companies. This type of marketing is mapped on the influence maximization problem (IMP) in the social networks, and its goal is finding a sp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::38aa9677b7f0cdd93120986f8b67c3b3
https://doi.org/10.1007/s13278-020-00694-z
https://doi.org/10.1007/s13278-020-00694-z
Publikováno v:
2020 6th International Conference on Web Research (ICWR).
The strength of information diffusion on social networks depends on many factors, including the selected influential nodes. The problem of finding such nodes in the network is modeled by influence maximization problem, which faces two essential chall
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::19fefe500c6078877dd709069192fd5b
https://doi.org/10.1109/icwr49608.2020.9122321
https://doi.org/10.1109/icwr49608.2020.9122321
Publikováno v:
Intelligent Data Analysis. 22:1163-1183
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e2f61d9bb365ba2ada14228d5a501cdf
https://doi.org/10.3233/ida-173582
https://doi.org/10.3233/ida-173582
Autor:
Saeed Farzi, Sahar Kianian
Publikováno v:
Digital Scholarship in the Humanities. 34:277-289
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a1035485d1e36207a8d6d1d8c2bddb0c
https://doi.org/10.1093/llc/fqy034
https://doi.org/10.1093/llc/fqy034
Publikováno v:
Digital Scholarship in the Humanities. 33:748-765
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9e5a116c2c6b4bb3c17960dcde1a3d39
https://doi.org/10.1093/llc/fqy009
https://doi.org/10.1093/llc/fqy009
Autor:
Sahar Kianian, Saeed Farzi
Publikováno v:
Journal of Experimental & Theoretical Artificial Intelligence. 30:795-809
Articulateness and plasticity are two essential attributes that make a graph as an efficient model to real life problems. Nowadays, the attributed graph is received lots of attentions because of us...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::88ef25a8a39230abba886994cae909cb
https://doi.org/10.1080/0952813x.2018.1467498
https://doi.org/10.1080/0952813x.2018.1467498
Publikováno v:
Journal of Intelligent & Fuzzy Systems. 32:3987-3998
5 Abstract. Finding community structures in online social networks is an important methodology for understanding the internal organization of users and actions. Most previous studies have focused on structural properties to detect communities. They d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3b9903917d077ce4d453565b08bf9c1f
https://doi.org/10.3233/jifs-151276
https://doi.org/10.3233/jifs-151276
Autor:
Sahar Kianian, Mehran Rostamnia
Publikováno v:
2019 5th Conference on Knowledge Based Engineering and Innovation (KBEI).
The Influence maximization problem is a fundamental problem in social networks analysis which aims to select a small set of nodes, as a seed set, and maximizes influence spread through the seed set under a specific propagation model. In this paper, t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0d5c9839e161dfc13f185a860f15a7f6
https://doi.org/10.1109/kbei.2019.8734949
https://doi.org/10.1109/kbei.2019.8734949