{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:51:49Z","timestamp":1725889909163},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642327407"},{"type":"electronic","value":"9783642327414"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-32741-4_13","type":"book-chapter","created":{"date-parts":[[2012,8,21]],"date-time":"2012-08-21T09:02:04Z","timestamp":1345539724000},"page":"137-148","source":"Crossref","is-referenced-by-count":1,"title":["A Relative Feature Selection Algorithm for Graph Classification"],"prefix":"10.1007","author":[{"given":"Yaser","family":"Keneshloo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sasan","family":"Yazdani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C.: On classification of graph streams. In: Proceedings of Eleventh SIAM International Conference on Data Mining, SDM 2011, Arizona, Mesa (2011)","DOI":"10.1137\/1.9781611972818.56"},{"issue":"1","key":"13_CR2","first-page":"975","volume":"3","author":"C.C. Aggarwal","year":"2010","unstructured":"Aggarwal, C.C., Li, Y., Yu, P.S., Jin, R.: On dense pattern mining in graph streams. PVDLB\u00a03(1), 975\u2013984 (2010)","journal-title":"PVDLB"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Zhao, Y., Yu, P.S.: On clustering graph streams. In: Proceedings of the SIAM International Conference on Data Mining, SDM 2010, Columbus, Ohio, USA (2010)","DOI":"10.1137\/1.9781611972801.42"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Auria, L., Moro, R.A.: Support Vector Machines (SVM) as a technique for solvency analysis. Discussion Papers of DIW Berlin (2008)","DOI":"10.2139\/ssrn.1424949"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Bondy, J.A.: Graph Theory with Applications, pp. 12\u201321. Elsevier Science Ltd. (1976)","DOI":"10.1007\/978-1-349-03521-2"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Cheng, H., Yan, X., Han, J., Hsu, C.: Discriminative frequent pattern analysis for effective classification. In: Proc. of ICDE, Istanbul, Turkey (2007)","DOI":"10.1109\/ICDE.2007.367917"},{"issue":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1656274.1656278","volume":"11","author":"M. Hall","year":"2009","unstructured":"Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., Witten, L.H.: The Weka data mining software: an update. SIGKDD Explor. Newsl.\u00a011(1), 10\u201318 (2009)","journal-title":"SIGKDD Explor. Newsl."},{"key":"13_CR8","unstructured":"He, H., Singh, A.K.: Closure-Tree: An index structure for graph queries. In: ICDE 2006, Atlanta, Georgia (2006)"},{"key":"13_CR9","unstructured":"Huan, J., Wang, W., Prins, J.: Efficient mining of frequent subgraph in the presence of isomorphism. In: Proceedings of the 3rd IEEE International Conference on Data Mining, ICDM 2003, Melbourne (2003)"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Kong, X., Fan, W., Yu, P.S.: Dual active feature and sample selection for graph classification. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, California (2011)","DOI":"10.1145\/2020408.2020511"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Kong, X., Yu, P.S.: Semi-supervised feature selection for graph classification. In: Proceeding of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data mining, Washington, DC (2010)","DOI":"10.1145\/1835804.1835905"},{"key":"13_CR12","unstructured":"Krishna, V., Suri, N.N.R.R., Athithan, G.: A comparative survey of algorithms for frequent subgraph discovery. Current Science\u00a0100(2) (2011)"},{"issue":"9","key":"13_CR13","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1109\/TKDE.2004.33","volume":"16","author":"M. Kuramochi","year":"2004","unstructured":"Kuramochi, M., Karypis, G.: An efficient algorithm for discovering frequent subgraphs. IEEE Transactions on Knowledge and Data Engineering\u00a016(9), 1038\u20131051 (2004)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"13_CR14","unstructured":"Li, G., Semerci, M., Yener, B., Zaki, M.J.: Graph Classification via Topological and Label Attributes. In: 9th Workshop on Mining and Learning with Graphs (with SIGKDD) (August 2011)"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Nijssen, S., Kok, J.: A quick start in frequent structure mining can make a difference. In: Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 647\u2013652. ACM (2004)","DOI":"10.1145\/1014052.1014134"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Parveen, P., Weger, Z.R., Thuraisingham, B.M., Hamlen, K.W., Khan, L.: Insider Threat Detection using Stream Mining and Graph Mining. In: IEEE 23rd International Conference on Tools with Artificial Intelligence, ICTAI 2011, Boca Raton, FL (2011)","DOI":"10.1109\/ICTAI.2011.176"},{"key":"13_CR17","unstructured":"Singh, A.K.: Graph querying, graph motif mining and the discovery of clusters, United State Patent, Santa Barbara, CA (2011)"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Thoma, M., Cheng, H., Gretton, A., Han, J., Kriegel, H., Smola, A., Song, L., Yu, P.S., Yan, X., Borgwardt, K.M.: Near-optimal supervised feature selection among frequent subgraphs. In: SIAM International Conference on Data Mining (2009)","DOI":"10.1137\/1.9781611972795.92"},{"key":"13_CR19","first-page":"1201","volume":"11","author":"S.V.N. Vishwanathan","year":"2010","unstructured":"Vishwanathan, S.V.N., Schraudolph, N.N., Kondor, I.R., Borgwardt, K.M.: Graph Kernels. Journal of Machine Learning Research\u00a011, 1201\u20131242 (2010)","journal-title":"Journal of Machine Learning Research"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Wale, N., Karypis, G.: Comparison of descriptor spaces for chemical compound retrieval and classification. In: Proc. of ICDM, Hong Kong, pp. 678\u2013689 (2006)","DOI":"10.21236\/ADA444816"},{"key":"13_CR21","unstructured":"Yan, X., Han, J.: gSpan: Graph-based substructure pattern mining. In: ICDM 2002 (2002)"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Substructure similarity search in graph databases. In: SIGMOD Conference (2005)","DOI":"10.1145\/1066157.1066244"}],"container-title":["Advances in Intelligent Systems and Computing","Advances in Databases and Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32741-4_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:14:29Z","timestamp":1620116069000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32741-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642327407","9783642327414"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32741-4_13","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2013]]}}}