Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Kangfei Zhao"'
Publikováno v:
Data Science and Engineering, Vol 8, Iss 3, Pp 292-305 (2023)
Abstract Deep Learning (DL) has been widely used in many applications, and its success is achieved with large training data. A key issue is how to provide a DL solution when there is no large training data to learn initially. In this paper, we explor
Externí odkaz:
https://doaj.org/article/3baf657fb0774df7a986f395355f6295
Publikováno v:
IEEE Transactions on Knowledge and Data Engineering. :1-14
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a988629149abf1f979ed0878f318a29c
https://doi.org/10.1109/tkde.2023.3236335
https://doi.org/10.1109/tkde.2023.3236335
Publikováno v:
The VLDB Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1bec24804fa5970955383a3da9afb13f
https://doi.org/10.1007/s00778-023-00781-5
https://doi.org/10.1007/s00778-023-00781-5
Publikováno v:
Proceedings of the 2022 International Conference on Management of Data.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4cdd6b0ae074a9f5804f6c352fb700ce
https://doi.org/10.1145/3514221.3526164
https://doi.org/10.1145/3514221.3526164
Publikováno v:
2022 IEEE 38th International Conference on Data Engineering (ICDE).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d7280cd3b0942fd54bbee1ce4f249629
https://doi.org/10.1109/icde53745.2022.00282
https://doi.org/10.1109/icde53745.2022.00282
Publikováno v:
2022 IEEE 38th International Conference on Data Engineering (ICDE).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6048b6c1150d6fa15c7d6cf4d1444f48
https://doi.org/10.1109/icde53745.2022.00146
https://doi.org/10.1109/icde53745.2022.00146
Publikováno v:
Proceedings of the VLDB Endowment. 13:2493-2507
In this paper, we study local subgraph counting, which is to count the occurrences of a user-given pattern graph p around every node v in a data graph G , when v matches to a given orbit o in p , where the orbit serves as a center to count p. In gene
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0bce28f78a7a9a07964802e1ad55f74d
https://doi.org/10.14778/3407790.3407840
https://doi.org/10.14778/3407790.3407840
Publikováno v:
Information Sciences. 481:141-159
As many real-world data are constructed into knowledge graphs, providing effective and convenient query techniques for end users is an urgent and important task. Although structured query languages, such as SPARQL, offer a powerful expression ability
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8b1eb22a863aa851588c8e697ee99da7
https://doi.org/10.1016/j.ins.2018.12.032
https://doi.org/10.1016/j.ins.2018.12.032
Publikováno v:
IJCNN
The Travelling Salesman Problem (TSP) is a classical NP-hard problem and has broad applications in many disciplines and industries. In a large scale location-based services system, users issue TSP queries concurrently, where a TSP query is a TSP inst
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::275c36214017f13a47a560f1e0431f8b
https://doi.org/10.1109/ijcnn52387.2021.9533538
https://doi.org/10.1109/ijcnn52387.2021.9533538
Publikováno v:
SIGMOD Conference
Subgraph counting, as a fundamental problem in network analysis, is to count the number of subgraphs in a data graph that match a given query graph by either homomorphism or subgraph isomorphism. The importance of subgraph counting derives from the f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::739e13299d9da5e8f93cc7346520a640
https://doi.org/10.1145/3448016.3457289
https://doi.org/10.1145/3448016.3457289