{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,18]],"date-time":"2024-07-18T02:07:51Z","timestamp":1721268471699},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,1,3]],"date-time":"2020-01-03T00:00:00Z","timestamp":1578009600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,3]],"date-time":"2020-01-03T00:00:00Z","timestamp":1578009600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1007\/s11704-019-8263-5","type":"journal-article","created":{"date-parts":[[2020,1,3]],"date-time":"2020-01-03T05:28:33Z","timestamp":1578029313000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A novel classifier for multivariate instance using graph class signatures"],"prefix":"10.1007","volume":"14","author":[{"given":"Parnika","family":"Paranjape","sequence":"first","affiliation":[]},{"given":"Meera","family":"Dhabu","sequence":"additional","affiliation":[]},{"given":"Parag","family":"Deshpande","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,3]]},"reference":[{"key":"8263_CR1","volume-title":"Pattern Recognition","author":"S Theodoridis","year":"2008","unstructured":"Theodoridis S, Koutroumbas K. Pattern Recognition. 4th ed. USA: Academic Press, Inc., 2008","edition":"4th ed."},{"key":"8263_CR2","doi-asserted-by":"crossref","unstructured":"Esmeir S, Markovitch S. Lookahead-based algorithms for anytime induction of decision trees. In: Proceedings of the 21st ACM International Conference on Machine Learning. 2004, 33","DOI":"10.1145\/1015330.1015373"},{"key":"8263_CR3","doi-asserted-by":"crossref","unstructured":"Tan P J, Dowe D L. MML inference of decision graphs with multi-way joins and dynamic attributes. In: Proceedings of Australasian Joint Conference on Artificial Intelligence. 2003, 269\u2013281","DOI":"10.1007\/978-3-540-24581-0_23"},{"key":"8263_CR4","doi-asserted-by":"crossref","unstructured":"Zhu Y, Yu J X, Cheng H, Qin L. Graph classification: a diversified discriminative feature selection approach. In: Proceedings of the 21st ACM International Conference on Information and Knowledge Management. 2012, 205\u2013214","DOI":"10.1145\/2396761.2396791"},{"key":"8263_CR5","doi-asserted-by":"crossref","unstructured":"Ranu S, Hoang M, Singh A K. Mining discriminative subgraphs from global-state networks. In: Proceedings of the 19th ACM International Conference on Knowledge Discovery and Data Mining. 2013, 509\u2013517","DOI":"10.1145\/2487575.2487692"},{"key":"8263_CR6","doi-asserted-by":"crossref","unstructured":"Dang X H, Singh A K, Bogdanov P, You H, Hsu B. Discriminative subnetworks with regularized spectral learning for global-state network data. In: Proceedings of Joint European Conference on Machine Learning and Knowledge Discovery in Databases. 2014, 290\u2013306","DOI":"10.1007\/978-3-662-44848-9_19"},{"key":"8263_CR7","doi-asserted-by":"crossref","unstructured":"Dang X H, You H, Bogdanov P, Singh A K. Learning predictive substructures with regularization for network data. In: Proceedings of IEEE International Conference on Data Mining. 2015, 81\u201390","DOI":"10.1109\/ICDM.2015.56"},{"issue":"97","key":"8263_CR8","first-page":"35","volume":"81","author":"J P Vert","year":"2004","unstructured":"Vert J P. Kernel methods in computational biology. Bussei Kenkyu, 2004, 81(97): 35\u201390","journal-title":"Bussei Kenkyu"},{"key":"8263_CR9","doi-asserted-by":"crossref","unstructured":"Mah\u00e9 P, Ueda N, Akutsu T, Perret J L. Extensions of marginalized graph kernels. In: Proceedings of the 21st ACM International Conference on Machine Learning. 2004, 70","DOI":"10.1145\/1015330.1015446"},{"key":"8263_CR10","doi-asserted-by":"crossref","unstructured":"Seeland M, Karwath A, Kramer S. A structural cluster kernel for learning on graphs. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2012, 516\u2013524","DOI":"10.1145\/2339530.2339614"},{"issue":"6","key":"8263_CR11","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1109\/TSMCB.2009.2019264","volume":"39","author":"K Riesen","year":"2009","unstructured":"Riesen K, Bunke H. Graph classification by means of Lipschitz embedding. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2009, 39(6): 1472\u20131483","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)"},{"issue":"6","key":"8263_CR12","doi-asserted-by":"publisher","first-page":"1537","DOI":"10.1110\/ps.062189906","volume":"15","author":"D Bandyopadhyay","year":"2006","unstructured":"Bandyopadhyay D, Huan J, Liu J, Prins J, Snoeyink J, Wang W, Tropsha A. Structure-based function inference using protein family-specific fingerprints. Protein Science, 2006, 15(6): 1537\u20131543","journal-title":"Protein Science"},{"key":"8263_CR13","doi-asserted-by":"crossref","unstructured":"Cheng H, Yan X, Han J, Hsu C W. Discriminative frequent pattern analysis for effective classification. In: Proceedings of the 23rd IEEE International Conference on Data Engineering. 2007, 716\u2013725","DOI":"10.1109\/ICDE.2007.367917"},{"issue":"8","key":"8263_CR14","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1109\/TKDE.2005.127","volume":"17","author":"M Deshpande","year":"2005","unstructured":"Deshpande M, Kuramochi M, Wale N, Karypis G. Frequent substructure-based approaches for classifying chemical compounds. IEEE Transactions on Knowledge and Data Engineering, 2005, 17(8): 1036\u20131050","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"8263_CR15","unstructured":"Yan X, Han J. gSpan: graph-based substructure pattern mining. In: Proceedings of the IEEE International Conference on Data Mining. 2002, 721\u2013724"},{"key":"8263_CR16","doi-asserted-by":"crossref","unstructured":"Inokuchi A, Washio T, Motoda H. An apriori-based algorithm for mining frequent substructures from graph data. In: Proceedings of European Conference on Principles of Data Mining and Knowledge Discovery. 2000, 13\u201323","DOI":"10.1007\/3-540-45372-5_2"},{"key":"8263_CR17","unstructured":"Kuramochi M, Karypis G. Frequent subgraph discovery. In: Proceedings of the IEEE International Conference on Data Mining. 2001, 313\u2013320"},{"key":"8263_CR18","unstructured":"Huan J, Wang W, Prins J. Efficient mining of frequent subgraphs in the presence of isomorphism. In: Proceedings of the 3rd IEEE International Conference on Data Mining. 2003, 549\u2013552"},{"key":"8263_CR19","doi-asserted-by":"crossref","unstructured":"Nijssen S, Kok J N. A quickstart in frequent structure mining can make adifference. In: Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2004, 647\u2013652","DOI":"10.1145\/1014052.1014134"},{"key":"8263_CR20","unstructured":"Zhou K. gBolt: very fast implementation for gSpan algorithm in data mining. GitHub, 2017"},{"key":"8263_CR21","doi-asserted-by":"crossref","unstructured":"Yan X, Cheng H, Han J, Yu P S. Mining significant graph patterns by leap search. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. 2008, 433\u2013444","DOI":"10.1145\/1376616.1376662"},{"key":"8263_CR22","doi-asserted-by":"crossref","unstructured":"Saigo H, Kr\u00e4mer N, Tsuda K. Partial least squares regression for graph mining. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2008, 578\u2013586","DOI":"10.1145\/1401890.1401961"},{"key":"8263_CR23","doi-asserted-by":"crossref","unstructured":"Thoma M, Cheng H, Gretton A, Han J, Kriegel H P, Smola A, Song L, Yu P S, Yan X, Borgwardt K. Near-optimal supervised feature selection among frequent subgraphs. In: Proceedings of the SIAM International Conference on Data Mining. 2009, 1076\u20131087","DOI":"10.1137\/1.9781611972795.92"},{"key":"8263_CR24","doi-asserted-by":"crossref","unstructured":"Ranu S, Singh A K. Graphsig: a scalable approach to mining significant subgraphs in large graph databases. In: Proceedings of the 25th IEEE International Conference on Data Engineering. 2009, 844\u2013855","DOI":"10.1109\/ICDE.2009.133"},{"key":"8263_CR25","doi-asserted-by":"crossref","unstructured":"Jin N, Young C, Wang W. Graph classification based on pattern cooccurrence. In: Proceedings of the 18th ACM Conference on Information and Knowledge Management. 2009, 573\u2013582","DOI":"10.1145\/1645953.1646027"},{"key":"8263_CR26","doi-asserted-by":"crossref","unstructured":"Jin N, Young C, Wang W. GAIA: graph classification using evolutionary computation. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. 2010, 879\u2013890","DOI":"10.1145\/1807167.1807262"},{"key":"8263_CR27","doi-asserted-by":"crossref","unstructured":"Kong X, Yu P S. Semi-supervised feature selection for graph classification. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2010, 793\u2013802","DOI":"10.1145\/1835804.1835905"},{"issue":"2","key":"8263_CR28","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s10115-011-0407-3","volume":"31","author":"X Kong","year":"2012","unstructured":"Kong X, Philip S Y. gMLC: a multi-label feature selection framework for graph classification. Knowledge and Information Systems, 2012, 31(2): 281\u2013305","journal-title":"Knowledge and Information Systems"},{"key":"8263_CR29","unstructured":"Pan S, Zhu X, Zhang C, Philip S Y. Graph stream classification using labeled and unlabeled graphs. In: Proceedings of the 29th IEEE International Conference on Data Engineering. 2013, 398\u2013409"},{"key":"8263_CR30","doi-asserted-by":"crossref","unstructured":"Kong X, Yu P S, Wang X, Ragin A B. Discriminative feature selection for uncertain graph classification. In: Proceedings of the SIAM International Conference on Data Mining. 2013, 82\u201393","DOI":"10.1137\/1.9781611972832.10"},{"issue":"10","key":"8263_CR31","doi-asserted-by":"publisher","first-page":"2382","DOI":"10.1109\/TKDE.2013.2297923","volume":"26","author":"J Wu","year":"2014","unstructured":"Wu J, Zhu X, Zhang C, Philip S Y. Bag constrained structure pattern mining for multi-graph classification. IEEE Transactions on Knowledge and Data Engineering, 2014, 26(10): 2382\u20132396","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"3","key":"8263_CR32","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1109\/TKDE.2015.2492567","volume":"28","author":"S Pan","year":"2016","unstructured":"Pan S, Wu J, Zhu X, Zhang C. Joint structure feature exploration and regularization for multi-task graph classification. IEEE Transactions on Knowledge and Data Engineering, 2016, 28(3): 715\u2013728","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"3","key":"8263_CR33","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1109\/TCYB.2016.2526058","volume":"47","author":"S Pan","year":"2017","unstructured":"Pan S, Wu J, Zhu X, Long G, Zhang C. Task sensitive feature exploration and learning for multitask graph classification. IEEE Transactions on Cybernetics, 2017, 47(3): 744\u2013758","journal-title":"IEEE Transactions on Cybernetics"},{"issue":"11","key":"8263_CR34","doi-asserted-by":"publisher","first-page":"3783","DOI":"10.1016\/j.patcog.2015.05.019","volume":"48","author":"S Pan","year":"2015","unstructured":"Pan S, Wu J, Zhu X, Long G, Zhang C. Finding the best not the most: regularized loss minimization subgraph selection for graph classification. Pattern Recognition, 2015, 48(11): 3783\u20133796","journal-title":"Pattern Recognition"},{"issue":"1","key":"8263_CR35","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10994-008-5089-z","volume":"75","author":"H Saigo","year":"2009","unstructured":"Saigo H, Nowozin S, Kadowaki T, Kudo T, Tsuda K. gBoost: a mathematical programming approach to graph classification and regression. Machine Learning, 2009, 75(1): 69\u201389","journal-title":"Machine Learning"},{"key":"8263_CR36","unstructured":"Pan S, Zhu X. Graph classification with imbalanced class distributions and noise. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence. 2013, 1586\u20131592"},{"key":"8263_CR37","unstructured":"Kudo T, Maeda E, Matsumoto Y. An application of boosting to graph classification. In: Proceedings of the 17th International Conference on Neural Information Processing Systems. 2004, 729\u2013736"},{"issue":"5","key":"8263_CR38","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1109\/TCYB.2014.2341031","volume":"45","author":"S Pan","year":"2015","unstructured":"Pan S, Wu J, Zhu X, Zhang C. Graph ensemble boosting for imbalanced noisy graph stream classification. IEEE Transactions on Cybernetics, 2015, 45(5): 954\u2013968","journal-title":"IEEE Transactions on Cybernetics"},{"issue":"11","key":"8263_CR39","doi-asserted-by":"publisher","first-page":"2933","DOI":"10.1109\/TKDE.2015.2391115","volume":"27","author":"S Pan","year":"2015","unstructured":"Pan S, Wu J, Zhu X. CogBoost: boosting for fast cost-sensitive graph classification. IEEE Transactions on Knowledge and Data Engineering, 2015, 27(11): 2933\u20132946","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"8263_CR40","doi-asserted-by":"crossref","unstructured":"Cook D J, Holder L B. Mining Graph Data. John Wiley & Sons, 2006","DOI":"10.1002\/0470073047"},{"key":"8263_CR41","doi-asserted-by":"crossref","unstructured":"Witten I H, Frank E, Hall M A, Pal C J. Data Mining: Practical Machine Learning Tools and Techniques. Morgan Kaufmann, 2016","DOI":"10.1016\/B978-0-12-804291-5.00010-6"},{"key":"8263_CR42","unstructured":"Thrun S B, Bala J W, Bloedorn E, Bratko I, Cestnik B, Cheng J, De Jong K A, Dzeroski S, Fisher D H, Fahlman S E, Hamann R. The monk\u2019s problems: a performance comparison of different learning algorithms. Technical Report of Carnegie Mellon University, 1991"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-019-8263-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-019-8263-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-019-8263-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,19]],"date-time":"2021-09-19T20:16:49Z","timestamp":1632082609000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-019-8263-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,3]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["8263"],"URL":"https:\/\/doi.org\/10.1007\/s11704-019-8263-5","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,3]]},"assertion":[{"value":"30 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"144307"}}