Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Yaowei Yan"'
Publikováno v:
IEEE Transactions on Knowledge and Data Engineering. 34:2020-2032
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9c461ec1c93f7c5cb2602ec8ea4bfdef
https://doi.org/10.1109/tkde.2020.3011674
https://doi.org/10.1109/tkde.2020.3011674
Publikováno v:
IEEE Transactions on Knowledge and Data Engineering. :1-14
Random Walk is a basic algorithm to explore the structure of networks, which can be used in many tasks, such as local community detection and network embedding. Existing random walk methods are based on single networks that contain limited informatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c0a60e7a07dee7944b85682a8e64876b
https://doi.org/10.1109/tkde.2022.3221668
https://doi.org/10.1109/tkde.2022.3221668
Publikováno v:
Knowledge and Information Systems. 62:2067-2101
Local community detection, which aims to find a target community containing a set of query nodes, has recently drawn intense research interest. The existing local community detection methods usually assume all query nodes are from the same community
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::13cbedc437a5bca0a95b4f38d4c51728
https://doi.org/10.1007/s10115-019-01398-3
https://doi.org/10.1007/s10115-019-01398-3
Publikováno v:
ICDE
This study investigates name disambiguation for scholarly data. We propose a collective approach, which considers the connections of different ambiguous names, such that it initially treats each author reference as a unique author entity and reformul
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::155e0f5284844b842fba6a3f408a4ca5
https://doi.org/10.1109/icde51399.2021.00244
https://doi.org/10.1109/icde51399.2021.00244
Publikováno v:
KDD
Local community detection aims to find a set of densely-connected nodes containing given query nodes. Most existing local community detection methods are designed for a single network. However, a single network can be noisy and incomplete. Multiple n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::29d65570c274d68b425118fa28383461
https://doi.org/10.1145/3394486.3403069
https://doi.org/10.1145/3394486.3403069
Publikováno v:
Artificial Intelligence Review. 49:439-453
Boolean Satisfiability (SAT) is an important problem in many domains. Modern SAT solvers have been widely used in important industrial applications including automated planning and verification. To solve more problems in real applications, new techni
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a28d911c1c3b4137af13346bf7106707
https://doi.org/10.1007/s10462-016-9530-6
https://doi.org/10.1007/s10462-016-9530-6
Publikováno v:
WWW
Detecting local graph clusters is an important problem in big graph analysis. Given seed nodes in a graph, local clustering aims at finding subgraphs around the seed nodes, which consist of nodes highly relevant to the seed nodes. However, existing l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2fcec0991a863a8620311bb1b1212a8c
https://doi.org/10.1145/3308558.3313719
https://doi.org/10.1145/3308558.3313719
Publikováno v:
ICDM
Local community detection, which aims to find a target community containing a set of query nodes, has recently drawn intense research interest. The existing local community detection methods usually assume all query nodes are from the same community
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::457d0702de45fa55f06f838c2c1b7cce
https://doi.org/10.1109/icdm.2018.00016
https://doi.org/10.1109/icdm.2018.00016
Autor:
Dongsheng Luo, Wei Fan, Xiong Yu, Jingchao Ni, Yaowei Yan, Xiang Zhang, Hongliang Fei, John Yen
Publikováno v:
Advances in Knowledge Discovery and Data Mining ISBN: 9783319930398
PAKDD (3)
PAKDD (3)
Searching local graph clusters is an important problem in big network analysis. Given a query node in a graph, local clustering aims at finding a subgraph around the query node, which consists of nodes highly relevant to the query node. Existing loca
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae22b0ea3893d4eacf515b36ee5d44fe
https://doi.org/10.1007/978-3-319-93040-4_39
https://doi.org/10.1007/978-3-319-93040-4_39
Publikováno v:
Knowledge and Information Systems. 62:2103-2104
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d1c3c182fb7423200121e9d9c426a24f
https://doi.org/10.1007/s10115-019-01414-6
https://doi.org/10.1007/s10115-019-01414-6