{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T02:20:01Z","timestamp":1717554001398},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,12,27]],"date-time":"2013-12-27T00:00:00Z","timestamp":1388102400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Inf Syst"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s10844-013-0299-7","type":"journal-article","created":{"date-parts":[[2013,12,26]],"date-time":"2013-12-26T05:57:02Z","timestamp":1388037422000},"page":"307-332","source":"Crossref","is-referenced-by-count":2,"title":["Finding the most descriptive substructures in graphs with discrete and numeric labels"],"prefix":"10.1007","volume":"42","author":[{"given":"Michael","family":"Davis","sequence":"first","affiliation":[]},{"given":"Weiru","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Miller","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,12,27]]},"reference":[{"key":"299_CR1","unstructured":"Achert, E., Kriegel, H.P., Schubert, E., Zimek, A. (2013). Interactive data mining with 3D-parallel-coordinate-trees. In Proceedings of the ACM international conference on management of data (SIGMOD)."},{"issue":"4","key":"299_CR2","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1016\/S0022-0000(03)00025-4","volume":"66","author":"D Achlioptas","year":"2003","unstructured":"Achlioptas, D. (2003). Database-friendly random projections: Johnson-Lindenstrauss with binary coins. Journal of Computer and System Sciences, 66(4), 671\u2013687. doi: 10.1016\/S0022-0000(03)00025-4 .","journal-title":"Journal of Computer and System Sciences"},{"key":"299_CR3","volume-title":"Outliers in statistical data","author":"V Barnett","year":"1994","unstructured":"Barnett, V., & Lewis, T. (1994). Outliers in statistical data, 3rd edn. Chichester: Wiley Probability & Statistics.","edition":"3"},{"key":"299_CR4","unstructured":"Borgelt, C. (2006). Canonical forms for frequent graph mining. In R. Decker & H.J. Lenz (Eds.), GfKl, springer, studies in classification, data analysis, and knowledge organization (pp. 337\u2013349)."},{"key":"299_CR5","doi-asserted-by":"crossref","unstructured":"Breunig, M.M., Kriegel, H.P., Ng, R.T., Sander, J. (2000). LOF: identifying density-based local outliers. In W. Chen, J.F. Naughton, P.A. Bernstein (Eds.), SIGMOD conference (pp. 93\u2013104). ACM.","DOI":"10.1145\/342009.335388"},{"issue":"3","key":"299_CR6","doi-asserted-by":"crossref","first-page":"15:1","DOI":"10.1145\/1541880.1541882","volume":"41","author":"V Chandola","year":"2009","unstructured":"Chandola, V., Banerjee, A., Kumar, V. (2009). Anomaly detection: a survey. ACM Computing Surveys, 41(3), 15:1\u201315:58. doi: 10.1145\/1541880.1541882 .","journal-title":"ACM Computing Surveys"},{"issue":"1","key":"299_CR7","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1613\/jair.43","volume":"1","author":"DJ Cook","year":"1994","unstructured":"Cook, D.J., & Holder, L.B. (1994). Substructure discovery using minimum description length and background knowledge. Journal of Artificial Intelligence Research, 1(1), 231\u2013255.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"299_CR8","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/5254.850825","volume":"15","author":"DJ Cook","year":"2000","unstructured":"Cook, D.J., & Holder, L.B. (2000). Graph-based data mining. IEEE Intelligent Systems, 15, 32\u201341.","journal-title":"IEEE Intelligent Systems"},{"key":"299_CR9","doi-asserted-by":"crossref","unstructured":"Davis, M., Liu, W., Miller, P., Redpath, G. (2011). Detecting anomalies in graphs with numeric labels. In C. Macdonald, I. Ounis, I. Ruthven (Eds.), Proceedings of the 20th ACM conference on information and knowledge management (CIKM 2011) (pp. 1197\u20131202). ACM.","DOI":"10.1145\/2063576.2063749"},{"key":"299_CR10","doi-asserted-by":"crossref","unstructured":"de Vries, T., Chawla, S., Houle, M. (2010). Finding local anomalies in very high dimensional space. In ICDM 2010 (pp. 128\u2013137). IEEE.","DOI":"10.1109\/ICDM.2010.151"},{"key":"299_CR11","unstructured":"Eberle, W., & Holder, L. (2011). Compression versus frequency for mining patterns and anomalies in graphs. In Ninth workshop on mining and learning with graphs (MLG 2011), SIGKDD, at the 17th ACM SIGKDD conference on knowledge discovery and data mining (KDD 2011). San Diego."},{"key":"299_CR12","doi-asserted-by":"crossref","unstructured":"Eichinger, F., B\u00f6hm, K., Huber, M. (2008). Mining edge-weighted call graphs to localise software bugs. In W. Daelemans, B. Goethals, K. Morik (Eds.), ECML\/PKDD (1), lecture notes in computer science (Vol. 5211, pp. 333\u2013348). Springer.","DOI":"10.1007\/978-3-540-87479-9_40"},{"key":"299_CR13","doi-asserted-by":"crossref","unstructured":"Eichinger, F., Huber, M., B\u00f6hm, K. (2010). On the usefulness of weight-based constraints in frequent subgraph mining. In ICAI 2010, BCS SGAI (pp. 65\u201378). doi: 10.1007\/978-0-85729-130-1_5 .","DOI":"10.1007\/978-0-85729-130-1_5"},{"key":"299_CR14","unstructured":"Fortin, S. (1996). The graph isomorphism problem. Tech. rep., Univ. of Alberta."},{"key":"299_CR15","doi-asserted-by":"crossref","unstructured":"Fowler, J. H., & Christakis, N.A. (2008). Dynamic spread of happiness in a large social network: longitudinal analysis over 20 years in the Framingham Heart Study. BMJ, 337, doi: 10.1136\/bmj.a2338 .","DOI":"10.1136\/bmj.a2338"},{"key":"299_CR16","doi-asserted-by":"crossref","unstructured":"G\u00fcnnemann, S., Boden, B., Seidl, T. (2011). DB-CSC: a density-based approach for subspace clustering in graphs with feature vectors. In Proceedings of the 2011 European conference on machine learning and knowledge discovery in databases, ECML PKDD11 (Vol. Part I, pp. 565\u2013580). Springer.","DOI":"10.1007\/978-3-642-23780-5_46"},{"key":"299_CR17","doi-asserted-by":"crossref","unstructured":"Huan, J., Wang, W., Prins, J., Yang, J. (2004). SPIN: mining maximal frequent subgraphs from graph databases. In KDD 2004 (pp. 581\u2013586). ACM.","DOI":"10.1145\/1014052.1014123"},{"key":"299_CR18","doi-asserted-by":"crossref","unstructured":"Inokuchi, A., Washio, T., Motoda, H. (2000). An Apriori-based algorithm for mining frequent substructures from graph data. In PKDD 2000 (pp. 13\u201323). Springer.","DOI":"10.1007\/3-540-45372-5_2"},{"key":"299_CR19","doi-asserted-by":"crossref","unstructured":"Janssens, J., Flesch, I., Postma, E. (2009). Outlier detection with one-class classifiers from ML and KDD. In International conference on machine learning and applications (ICMLA \u201909) (pp. 147\u2013153). doi: 10.1109\/ICMLA.2009.16 .","DOI":"10.1109\/ICMLA.2009.16"},{"key":"299_CR20","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-3-642-15105-7_7","volume-title":"Proceedings of the 12th international conference on data warehousing and knowledge discovery, DaWaK\u201910","author":"C Jiang","year":"2010","unstructured":"Jiang, C., Coenen, F., Zito, M. (2010). Frequent sub-graph mining on edge weighted graphs. In Proceedings of the 12th international conference on data warehousing and knowledge discovery, DaWaK\u201910 (pp. 77\u201388). Berlin: Springer."},{"key":"299_CR21","doi-asserted-by":"crossref","unstructured":"Jin, W., Tung, A.K.H., Han, J. (2001). Mining top-n local outliers in large databases. In D. Lee, M. Schkolnick, F.J. Provost, R. Srikant (Eds.), KDD (pp. 293\u2013298). ACM.","DOI":"10.1145\/502512.502554"},{"key":"299_CR22","doi-asserted-by":"crossref","unstructured":"Jin, W., Tung, A.K.H., Han, J., Wang, W. (2006). Ranking outliers using symmetric neighborhood relationship. In W.K. Ng, M. Kitsuregawa, J. Li, K. Chang (Eds.), PAKDD, lecture notes in computer science (Vol. 3918, pp. 577\u2013593). Springer.","DOI":"10.1007\/11731139_68"},{"key":"299_CR23","unstructured":"Kim, M., & Leskovec, J. (2011). Modeling social networks with node attributes using the multiplicative attribute graph model. In F.G Cozman & A. Pfeffer (Eds.), UAI (pp. 400\u2013409). AUAI Press."},{"issue":"1\u20132","key":"299_CR24","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1080\/15427951.2012.625257","volume":"8","author":"M Kim","year":"2012","unstructured":"Kim, M., & Leskovec, J. (2012). Multiplicative attribute graph model of real-world networks. Internet Mathematics, 8(1\u20132), 113\u2013160.","journal-title":"Internet Mathematics"},{"key":"299_CR25","doi-asserted-by":"crossref","unstructured":"Klimt, B., & Yang, Y. (2004). The Enron corpus: a new dataset for email classification research. In J.F. Boulicaut, F. Esposito, F. Giannotti, D. Pedreschi (Eds.), ECML, lecture notes in computer science (Vol. 3201, pp. 217\u2013226). Springer.","DOI":"10.1007\/978-3-540-30115-8_22"},{"key":"299_CR26","doi-asserted-by":"crossref","unstructured":"Kriegel, H.P., Kr\u00f6ger, P., Schubert, E., Zimek, A. (2009). Outlier detection in axis-parallel subspaces of high dimensional data. In T. Theeramunkong, B. Kijsirikul, N. Cercone, T.B. Ho (Eds.), PAKDD, lecture notes in computer science (Vol. 5476, pp. 831\u2013838). Springer.","DOI":"10.1007\/978-3-642-01307-2_86"},{"key":"299_CR27","doi-asserted-by":"crossref","unstructured":"Kriegel, H.P., Kr\u00f6ger, P., Schubert, E., Zimek, A. (2011). Interpreting and unifying outlier scores. In SDM (pp. 13\u201324). SIAM\/Omnipress.","DOI":"10.1137\/1.9781611972818.2"},{"key":"299_CR28","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., & Karypis, G. (2001). Frequent subgraph discovery. In ICDM 2001 (pp. 313\u2013320). IEEE.","DOI":"10.1109\/ICDM.2001.989534"},{"key":"299_CR29","volume-title":"The smartest guys in the room: the amazing rise and scandalous fall of Enron","author":"B McLean","year":"2003","unstructured":"McLean, B., & Elkind, P. (2003). The smartest guys in the room: the amazing rise and scandalous fall of Enron. USA: Penguin Group."},{"key":"299_CR30","doi-asserted-by":"crossref","unstructured":"Moser, F., Colak, R., Rafiey, A., Ester, M. (2009). Mining cohesive patterns from graphs with feature vectors. In SDM (pp. 593\u2013604). SIAM.","DOI":"10.1137\/1.9781611972795.51"},{"key":"299_CR31","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: an introduction","author":"M Newman","year":"2010","unstructured":"Newman, M. (2010). Networks: an introduction. New York: Oxford University Press, Inc."},{"key":"299_CR32","doi-asserted-by":"crossref","unstructured":"Nijssen, S., & Kok, J.N. (2004). A quickstart in frequent structure mining can make a difference. In W. Kim, R. Kohavi, J. Gehrke, W. DuMouchel (Eds.), KDD (pp. 647\u2013652). ACM.","DOI":"10.1145\/1014052.1014134"},{"key":"299_CR33","unstructured":"Palacio, M.A.P. (2005). Spatial data modeling and mining using a graph-based representation. PhD thesis, Department of Computer Systems Engineering. Puebla: University of the Americas."},{"key":"299_CR34","doi-asserted-by":"crossref","unstructured":"Papadimitriou, S., Kitagawa, H., Gibbons, P.B., Faloutsos, C. (2003). LOCI: fast outlier detection using the local correlation integral. In U. Dayal, K. Ramamritham, T.M. Vijayaraman (Eds.), ICDE (pp. 315\u2013326). IEEE Computer Society.","DOI":"10.1109\/ICDE.2003.1260802"},{"key":"299_CR35","doi-asserted-by":"crossref","unstructured":"Schubert, E., Zimek, A., Kriegel, H.P. (2012). Local outlier detection reconsidered: a generalized view on locality with applications to spatial, video, and network outlier detection. Data Mining and Knowledge Discovery. doi: 10.1007\/s10618-012-0300-z .","DOI":"10.1007\/s10618-012-0300-z"},{"key":"299_CR36","doi-asserted-by":"crossref","unstructured":"Tang, J., Chen, Z., Fu, A.W.C., Cheung, D.W.L. (2002). Enhancing effectiveness of outlier detections for low density patterns. In M.S. Cheng, P.S. Yu, B. Liu (Eds.), PAKDD, lecture notes in computer science (Vol. 2336, pp. 535\u2013548). Springer.","DOI":"10.1007\/3-540-47887-6_53"},{"issue":"5500","key":"299_CR37","doi-asserted-by":"crossref","first-page":"2319","DOI":"10.1126\/science.290.5500.2319","volume":"290","author":"JB Tenenbaum","year":"2000","unstructured":"Tenenbaum, J.B., de Silva, V., Langford, J.C. (2000). A global geometric framework for nonlinear dimensionality reduction. Science, 290(5500), 2319\u20132323. doi: 10.1126\/science.290.5500.2319 .","journal-title":"Science"},{"key":"299_CR38","doi-asserted-by":"crossref","unstructured":"Wang, C., Zhu, Y., Wu, T., Wang, W., Shi, B. (2005). Constraint-based graph mining in large database. In Y. Zhang, K. Tanaka, J.X. Yu, S. Wang, M. Li (Eds.), APWeb, lecture notes in computer science (Vol. 3399, pp. 133\u2013144). Springer.","DOI":"10.1007\/978-3-540-31849-1_14"},{"key":"299_CR39","doi-asserted-by":"crossref","unstructured":"W\u00f6rlein, M., Meinl, T., Fischer, I., Philippsen, M. (2005). A quantitative comparison of the subgraph miners MoFa, gSpan, FFSM, and Gaston. In A. Jorge, L. Torgo, P. Brazdil, R. Camacho, J. Gama (Eds.), PKDD, lecture notes in computer science (Vol. 3721, pp. 392\u2013403). Springer.","DOI":"10.1007\/11564126_39"},{"key":"299_CR40","unstructured":"Yan, X., & Han, J. (2002). gSpan: graph-based substructure pattern mining. In ICDM 2002 (pp. 721\u2013724). IEEE."},{"key":"299_CR41","doi-asserted-by":"crossref","unstructured":"Yan, X., & Han, J. (2003). CloseGraph: mining closed frequent graph patterns. In KDD 2003 (pp. 286\u2013295). ACM.","DOI":"10.1145\/956750.956784"},{"issue":"5","key":"299_CR42","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1002\/sam.11161","volume":"5","author":"A Zimek","year":"2012","unstructured":"Zimek, A., Schubert, E., Kriegel, H.P. (2012). A survey on unsupervised outlier detection in high-dimensional numerical data. Statistical Analysis and Data Mining, 5(5), 363\u2013387.","journal-title":"Statistical Analysis and Data Mining"}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-013-0299-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10844-013-0299-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-013-0299-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,5]],"date-time":"2019-08-05T10:02:47Z","timestamp":1564999367000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10844-013-0299-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,27]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["299"],"URL":"https:\/\/doi.org\/10.1007\/s10844-013-0299-7","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"value":"0925-9902","type":"print"},{"value":"1573-7675","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,27]]}}}