A lossy counting based approach for learning on streams of graphs on a budget

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2013, Pages 1294-1301

  Da San Martino, Giovanni ^a   Navarin, Nicolò ^a   Sperduti, Alessandro ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BUDGET MANAGEMENT; CLASSIFICATION PERFORMANCE; COMPUTATIONAL BURDEN; ONLINE LEARNING ALGORITHMS; TIME CONSTRAINTS;

ARTIFICIAL INTELLIGENCE; LEARNING ALGORITHMS;

BUDGET CONTROL;

EID: 84896064017     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. Cesare Alippi, Manuel Roveri, and Francesco Trovò. A "learning from models" cognitive fault diagnosis system. In ICANN, pages 305-313, 2012.
2. Tatsuya Asai, Hiroki Arimura, Kenji Abe, Shinji Kawasoe, and Setsuo Arikawa. Online algorithms for mining semi-structured data stream. Data Mining, IEEE International Conference on, page 27, 2002.
3. Albert Bifet and Ricard Gavalda. Mining adaptively frequent closed unlabeled rooted trees in data streams. In Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '08, pages 34-42, New York, NY, USA, 2008. ACM.
4. A. Bifet, G. Holmes, B. Pfahringer, R. Kirby, and R. Gavaldá. New ensemble methods for evolving data streams. In Proceedings of the 15th International Conference on Knowledge Discovery and Data Mining, pages 139-148, 2009.
5. Albert Bifet, Geoff Holmes, Bernhard Pfahringer, and Ricard Gavalda. Mining frequent closed graphs on evolving data streams. Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '11, page 591, 2011.
6. Fang Chu and Carlo Zaniolo. Fast and light boosting for adaptive mining of data streams. In Proceedings of the 8th Pacific-Asia Conference Advances in Knowledge Discovery and Data Mining (PAKDD'04), pages 282-292, Sydney, Australia, 2004.
7. Fabrizio Costa and Kurt De Grave. Fast neighborhood subgraph pairwise distance kernel. In Proceedings of the 26th International Conference on Machine Learning, 2010.
8. Koby Crammer, Ofer Dekel, Joseph Keshet, Shai Shalev-Shwartz, and Yoram Singer. Online passive-aggressive algorithms. Journal of Machine Learning Research, 7:551-585, 2006.
9. Nello Cristianini and John Shawe-Taylor. An Introduction to Support Vector Machines and Other Kernel-based Learning Methods. Cambridge University Press, 1 edition, 2000.
10. Giovanni Da San Martino, Nicolò Navarin, and Alessandro Sperduti. A tree-based kernel for graphs. In Proceedings of the 12th SIAM International Conference on Data Mining, pages 975-986, 2012.
11. P. Domingos and G. Hulten. Mining high-speed data streams. In Proceedings of the 6th International Conference on Knowledge Discovery and Data Mining (KDD'00), pages 71-80, Boston. MA, 2000.
12. Mojtaba Eskandari and Sattar Hashemi. A graph mining approach for detecting unknown malwares. Journal of Visual Languages & Computing, mar 2012.
13. J. Gama and C. Pinto. Discretization from data streams: applications to histograms and data mining. In Proceedings of the 2006 ACM symposium on Applied computing (SAC'06), pages 662-667, 2006.
14. G. Hulten, L. Spencer, and P. Domingos. Mining time changing data streams. In Proceedings of the 7th International Conference on Knowledge Discovery and Data Mining (KDD'01), pages 97-106, 2001.
15. J. Z. Kolter and M. A. Maloof. Dynamic weighted majority: An ensemble method for drifting concepts. Journal of Machine Learning Research, 8:2755-2790, 2007.
16. Bin Li, Xingquan Zhu, Lianhua Chi, and Chengqi Zhang. Nested Subtree Hash Kernels for Large- Scale Graph Classification over Streams. 2012 IEEE 12th International Conference on Data Mining, pages 399-408, December 2012.
17. Gurmeet Singh Manku and Rajeev Motwani. Approximate frequency counts over data streams. In Proceedings of the 28th international conference on Very Large Data Bases, VLDB '02, pages 346- 357. VLDB Endowment, 2002.
18. N. C. Oza and S. Russell. Online bagging and boosting. In Proceedings of 8th International Workshop on Artificial Intelligence and Statistics (AISTATS'01), pages 105-112, Key West, FL, 2001.
19. B. Pfahringer, G. Holmes, and R. Kirkby. Handling numeric attributes in hoeffding trees. In Proceeding of the 2008 Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD'08), pages 296-307, Osaka, Japan, 2008.
20. F. Rosenblatt. The perceptron: A probabilistic model for information storage and organization in the brain. Psychological review, 65(6):386-408, 1958.
21. BC Russell and Antonio Torralba. LabelMe: a database and web-based tool for image annotation. International journal of Computer Vision, 77(1-3):157-173, 2008.
22. M. Scholz and R. Klinkenberg. An ensemble classifier for drifting concepts. In Proceeding of 2nd International Workshop on Knowledge Discovery from Data Streams, in conjunction with ECMLPKDD 2005, pages 53-64, Porto, Portugal, 2005.
23. Nino Shervashidze and Karsten Borgwardt. Fast subtree kernels on graphs. In Y. Bengio, D. Schuurmans, J. Lafferty, C. K. I. Williams, and A. Culotta, editors, Advances in Neural Information Processing Systems 22, pages 1660-1668. 2009.
24. W. N. Street and Y. Kim. A streaming ensemble algorithm (SEA) for large-scale classification. In Proceedings of the 7th International Conference on Knowledge Discovery and Data Mining (KDD'01), pages 377-382, San Francisco, CA, 2001.
25. Peter Su and Robert L Scot Drysdale. A Comparison of Sequential Delaunay Triangulation Algorithms. pages 1-24, 1996.
26. S. V. N. Vishwanathan, Nicol N. Schraudolph, Risi Imre Kondor, and Karsten M. Borgwardt. Graph kernels. Journal of Machine Learning Research, 11:1201-1242, 2010.
27. Zhuang Wang and Slobodan Vucetic. Online passive-aggressive algorithms on a budget. Journal of Machine Learning Research - Proceedings Track, 9:908-915, 2010.