Abstract
Data mining practitioners are facing challenges from data with network structure. In this paper, we address a specific class of global-state networks which comprises of a set of network instances sharing a similar structure yet having different values at local nodes. Each instance is associated with a global state which indicates the occurrence of an event. The objective is to uncover a small set of discriminative subnetworks that can optimally classify global network values. Unlike most existing studies which explore an exponential subnetwork space, we address this difficult problem by adopting a space transformation approach. Specifically, we present an algorithm that optimizes a constrained dual-objective function to learn a low-dimensional subspace that is capable of discriminating networks labelled by different global states, while reconciling with common network topology sharing across instances. Our algorithm takes an appealing approach from spectral graph learning and we show that the globally optimum solution can be achieved via matrix eigen-decomposition.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Aggarwal, C.C., Wang, H.: A survey of clustering algorithms for graph data. In: Managing and Mining Graph Data, pp. 275–301 (2010)
Akoglu, L., McGlohon, M., Faloutsos, C.: oddball: Spotting anomalies in weighted graphs. In: Zaki, M.J., Yu, J.X., Ravindran, B., Pudi, V. (eds.) PAKDD 2010, Part II. LNCS (LNAI), vol. 6119, pp. 410–421. Springer, Heidelberg (2010)
Bentley, J.L.: Multidimensional binary search trees used for associative searching 18(9), 509–517 (1975)
Bogdanov, P., Faloutsos, C., Mongiovì, M., Papalexakis, E.E., Ranca, R., Singh, A.K.: Netspot: Spotting significant anomalous regions on dynamic networks. In: SDM, pp. 28–36 (2013)
Bogdanov, P., Mongiovì, M., Singh, A.K.: Mining heavy subgraphs in time-evolving networks. In: ICDM, pp. 81–90 (2011)
Cline, A.K., Dhillon, I.S.: Computation of the Singular Value Decomposition. In: Handbook of Linear Algebra. CRC Press (2006)
Dang, X.H., Assent, I., Ng, R.T., Zimek, A., Schubert, E.: Discriminative features for identifying and interpreting outliers. In: ICDE, pp. 88–99 (2014)
Dang, X.H., Micenková, B., Assent, I., Ng, R.T.: Local outlier detection with interpretation. In: Blockeel, H., Kersting, K., Nijssen, S., Železný, F. (eds.) ECML PKDD 2013, Part III. LNCS (LNAI), vol. 8190, pp. 304–320. Springer, Heidelberg (2013)
Dannenfelser, R., Clark, N.R., Ma’ayan, A.: Genes2fans: connecting genes through functional association networks. BMC Bioinformatics 13(1), 156 (2012)
Davidson, I.N., Gilpin, S., Carmichael, O.T., Walker, P.B.: Network discovery via constrained tensor analysis of fmri data. In: KDD, pp. 194–202 (2013)
Dutkowski, J., Ideker, T.: Protein networks as logic functions in development and cancer. PLoS Computational Biology 7(9) (2011)
Golub, G.H., Loan, C.F.V.: Matrix Computations, 3rd edn. The Johns Hopkins University Press (1996)
Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning. Data Mining, Inference, and Prediction (2001)
Hui, L., Zhiyu, P., et al.: Genome-wide association study dissects the genetic architecture of oil biosynthesis in maize kernels. Nature Genetics 45, 43–50 (2013)
Jiang, C., Coenen, F., Zito, M.: A survey of frequent subgraph mining algorithms. Knowledge Eng. Review 28(1), 75–105 (2013)
Jin, N., Young, C., Wang, W.: Graph classification based on pattern co-occurrence. In: CIKM, pp. 573–582 (2009)
Jin, N., Young, C., Wang, W.: Gaia: graph classification using evolutionary computation. In: SIGMOD Conference, pp. 879–890 (2010)
Ketkar, N.S., Holder, L.B., Cook, D.J.: Empirical comparison of graph classification algorithms. In: ICDM, pp. 259–266 (2009)
Ki, D.H., Jeung, H.-C., Park, C.H., Kang, S.H., Lee, G.Y., Lee, W.S., Kim, N.K., Chung, H.C., Rha, S.Y.: Whole genome analysis for liver metastasis gene signatures in colorectal cancer. International Journal of Cancer 121(9) (2007)
Ki, D.H., Jeung, H.-C., Park, C.H., Kang, S.H., Lee, G.Y., Lee, W.S., Kim, N.K., Chung, H.C., Rha, S.Y.: Whole genome analysis for liver metastasis gene signatures in colorectal cancer. Int. J. Cancer 121(9), 2005–2012 (2007)
Lee, D., Jeong, O.-R., Lee, S.-G.: Opinion mining of customer feedback data on the web. In: ICUIMC 2008, pp. 230–235. ACM (2008)
Li, C., Li, H.: Network-constrained regularization and variable selection for analysis of genomic data. Bioinformatics 24(9), 1175–1182 (2008)
Li, C., Li, H.: Variable selection and regression analysis for graph-structured covariates with an application to genomics. The Annals of Applied Statistics 4(3), 1498–1516 (2010)
Mongiovì, M., Bogdanov, P., Singh, A.K.: Mining evolving network processes. In: ICDM, pp. 537–546 (2013)
Noirel, J., Sanguinetti, G., Wright, P.C.: Identifying differentially expressed subnetworks with mmg. Bioinformatics 24(23), 2792–2793 (2008)
Ranu, S., Hoang, M., Singh, A.K.: Mining discriminative subgraphs from global-state networks. In: KDD, pp. 509–517 (2013)
Ranu, S., Singh, A.K.: Graphsig: A scalable approach to mining significant subgraphs in large graph databases. In: ICDE, pp. 844–855 (2009)
Soundarajan, S., Eliassi-Rad, T., Gallagher, B.: Which network similarity method should you choose? In: Workshop on Information Networks at NYU (2013)
Yan, X., Cheng, H., Han, J., Yu, P.S.: Mining significant graph patterns by leap search. In: SIGMOD Conference, pp. 433–444 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dang, X.H., Singh, A.K., Bogdanov, P., You, H., Hsu, B. (2014). Discriminative Subnetworks with Regularized Spectral Learning for Global-State Network Data. In: Calders, T., Esposito, F., Hüllermeier, E., Meo, R. (eds) Machine Learning and Knowledge Discovery in Databases. ECML PKDD 2014. Lecture Notes in Computer Science(), vol 8724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44848-9_19
Download citation
DOI: https://doi.org/10.1007/978-3-662-44848-9_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44847-2
Online ISBN: 978-3-662-44848-9
eBook Packages: Computer ScienceComputer Science (R0)