( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Learning Hypersphere for Few-shot Anomaly Detection on Attributed Networks.

, , , , , и . CIKM, стр. 635-645. ACM, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Dian Handayani

Xiaokang Ouyang

Yingkai Ouyang

Mahmud Dianati

Nadja Diane

 

Другие публикации лиц с тем же именем

Speeding Up GED Verification for Graph Similarity Search., , , , , и . ICDE, стр. 793-804. IEEE, (2020)Parallelize Accelerated Triangle Counting Using Bit-Wise on GPU., , , и . WISA, том 14094 из Lecture Notes in Computer Science, стр. 551-558. Springer, (2023)(p,q)-biclique counting and enumeration for large sparse bipartite graphs., , , , , и . VLDB J., 32 (5): 1137-1161 (сентября 2023)Efficient Maximal Biclique Enumeration on Large Signed Bipartite Graphs., , , , , и . IEEE Trans. Knowl. Data Eng., 36 (9): 4618-4631 (сентября 2024)Learning Hypersphere for Few-shot Anomaly Detection on Attributed Networks., , , , , и . CIKM, стр. 635-645. ACM, (2022)Efficient shortest distance query processing and indexing on large road network. University of Technology Sydney, Australia, (2019)Hop-Constrained s-t Simple Path Enumeration on Large Dynamic Graphs., , , , , и . ICDE, стр. 762-775. IEEE, (2023)Progressive Top-K Nearest Neighbors Search in Large Road Networks., , , , , и . SIGMOD Conference, стр. 1781-1795. ACM, (2020)Size-Constrained Community Search on Large Networks: An Effective and Efficient Solution., , , , , и . IEEE Trans. Knowl. Data Eng., 36 (1): 356-371 (января 2024)Truss Decomposition on Multilayer Graphs., , , , и . IEEE BigData, стр. 5912-5915. IEEE, (2021)