TY - GEN
T1 - Cube2net
T2 - 19th IEEE International Conference on Data Mining Workshops, ICDMW 2019
AU - Yang, Carl
AU - Han, Jiawei
N1 - Funding Information:
ACKNOWLEDGEMENTS Research was sponsored in part by U.S. Army Research Lab. under Cooperative Agreement No. W911NF-09-2-0053 (NSCTA), DARPA under Agreement No. W911NF-17-C-0099, National Science Foundation IIS 16-18481, IIS 17-04532, and IIS-17-41317, DTRA HDTRA11810026, and grant 1U54GM114838 awarded by NIGMS through funds provided by the trans-NIH Big Data to Knowledge (BD2K) initiative (www.bd2k.nih.gov).
Funding Information:
Research was sponsored in part by U.S. Army Research Lab. under Cooperative Agreement No. W911NF-09-2-0053 (NSCTA), DARPA under Agreement No. W911NF-17-C- 0099, National Science Foundation IIS 16-18481, IIS 17- 04532, and IIS-17-41317, DTRA HDTRA11810026, and grant 1U54GM114838 awarded by NIGMS through funds provided by the trans-NIH Big Data to Knowledge (BD2K) initiative (www.bd2k.nih.gov).
Publisher Copyright:
© 2019 IEEE.
PY - 2019/11
Y1 - 2019/11
N2 - Networks are widely used to model objects with interactions and have enabled various downstream applications. However, in the real world, network mining is often done on particular query sets of objects, which does not require the construction and computation of networks including all objects in the datasets. In this work, for the first time, we propose to address the problem of query-specific network construction, to break the efficiency bottlenecks of existing network mining algorithms and facilitate various downstream tasks. To deal with real-world massive networks with complex attributes, we propose to leverage the well-developed data cube technology to organize network objects w.r.t their essential attributes. An efficient reinforcement learning algorithm is then developed to automatically explore the data cube structures and construct the optimal query-specific networks. With extensive experiments of two classic network mining tasks on different real-world large datasets, we show that our proposed cube2net pipeline is general, and much more effective and efficient in query-specific network construction, compared with other methods without the leverage of data cube or reinforcement learning.
AB - Networks are widely used to model objects with interactions and have enabled various downstream applications. However, in the real world, network mining is often done on particular query sets of objects, which does not require the construction and computation of networks including all objects in the datasets. In this work, for the first time, we propose to address the problem of query-specific network construction, to break the efficiency bottlenecks of existing network mining algorithms and facilitate various downstream tasks. To deal with real-world massive networks with complex attributes, we propose to leverage the well-developed data cube technology to organize network objects w.r.t their essential attributes. An efficient reinforcement learning algorithm is then developed to automatically explore the data cube structures and construct the optimal query-specific networks. With extensive experiments of two classic network mining tasks on different real-world large datasets, we show that our proposed cube2net pipeline is general, and much more effective and efficient in query-specific network construction, compared with other methods without the leverage of data cube or reinforcement learning.
KW - Cube networks
KW - Data cube
KW - Network embedding
KW - Network mining
KW - Reinforcement learning
UR - http://www.scopus.com/inward/record.url?scp=85078728303&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85078728303&partnerID=8YFLogxK
U2 - 10.1109/ICDMW.2019.00159
DO - 10.1109/ICDMW.2019.00159
M3 - Conference contribution
AN - SCOPUS:85078728303
T3 - IEEE International Conference on Data Mining Workshops, ICDMW
SP - 1088
EP - 1089
BT - Proceedings - 19th IEEE International Conference on Data Mining Workshops, ICDMW 2019
A2 - Papapetrou, Panagiotis
A2 - Cheng, Xueqi
A2 - He, Qing
PB - IEEE Computer Society
Y2 - 8 November 2019 through 11 November 2019
ER -