A scalable supervised algorithm for dimensionality reduction on streaming data

Information Sciences

Volumn 176, Issue 14, 2006, Pages 2042-2065

  Yan, Jun ^a   Zhang, Benyu ^b   Yan, Shuicheng ^a   Liu, Ning ^c   Yang, Qiang ^d   Cheng, Qiansheng ^a   Li, Hua ^e   Chen, Zheng ^b   Ma, Wei Ying ^b  

^a LMAM   (China)

^b MICROSOFT RESEARCH ASIA   (China)

^c TSINGHUA UNIVERSITY   (China)

^d HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^e PEKING UNIVERSITY   (China)

Author keywords

Dimensionality reduction; Linear discriminant analysis (LDA); Maximum margin criterion (MMC); Principal component analysis (PCA); Streaming data

Indexed keywords

CLASSIFICATION (OF INFORMATION); DATA REDUCTION; LINEAR SYSTEMS; PRINCIPAL COMPONENT ANALYSIS; PROBLEM SOLVING;

DIMENSIONALITY REDUCTION; LINEAR DISCRIMINANT ANALYSIS (LDA); MAXIMUM MARGIN CRITERION (MMC); STREAMING DATA;

ALGORITHMS;

EID: 33646150192     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2005.11.005     Document Type: Article

References (28)

1. M. Artae, M. Jogan, A. Leonardis, Incremental PCA for on-line visual learning and recognition, in: Proceeding of the 16th International Conference on Pattern Recognition, Quebec City, QC, Canada, 2002.
2. B. Babcock, Models and issues in data stream systems, in: Proceeding of the ACM PODS, 2002.
3. Balakrishnama S., and Ganapathiraju A. Linear Discriminant Analysis-A brief Tutorial (1998), Institute for Signal and Information Processing, Mississippi
4. C.L. Blake, C.J. Merz, UCI Repository of machine learning databases Irvine, University of California, Department of Information and Computer Science, California, 1998.
5. A. Broder, M. Mitzenmacher, Network applications of bloom filters: a survey, in: Proceeding of the Allerton Conference, 2002.
6. M. Charikar, K. Chen, M. Farach-Colton, Finding frequent items in data streams, in: Proceeding of the ICALP, 2002.
7. Gilbert A., et al. Surfing wavelets on streams: one pass summaries for approximate aggregate queries. VLDB Journal (2001) 79-88
8. A. Globerson, G. Chechik, N. Tishby, Sufficient dimensionality reduction with irrelevance statistics, in: Proceeding of the 19th Conference on Uncertainty in Artificial Intelligence, Acapulco, Mexico, 2003.
9. Hiraoka K., et al. Convergence analysis of online linear discriminant analysis. International Joint Conference on Neural Networks IJCNN'00 3 (2000) 3387
10. Indyk P. Stable distributions, pseudorandom generators, embeddings and data stream computation. IEEE FOCS (2000) 189-197
11. S. Khanna, M. Greenwald, Space-efficient online computation of quantile summaries, in: Proceeding of the ACM SIGMOD, 2001.
12. Kushner H.J., and Clark D.S. Stochastic Approximation Methods for Constrained and Unconstrained System (1978), Springer-Verlag, New York
13. Lewis D., et al. RCV1: a new benchmark collection for text categorization research. Journal of Machine Learning Research 5 (2004) 361-397
14. Li H., Jiang T., and Zhang K. Efficient and robust feature extraction by maximum margin criterion. Proceeding of the Advances in Neural Information Processing Systems 16 (2004), MIT Press, Vancouver, Canada
15. G. Manku, R. Motwani, Approximate frequency counts over data streams, in: Proceeding of the VLDB, 2002.
16. Martinez A.M., and Kak A.C. PCA versus LDA. IEEE Transactions on Pattern Analysis and Machine Intelligence 23 2 (2001) 228-233
17. N. Mishra, D. Oblinger, L. Pitt, Sublinear time approximate clustering, in: Proceeding of the ACM-SIAM SODA, 2001.
18. Muthukrishnan S. Data Stream Algorithms and Applications (2004), Rutgers/AT&T Shannon Labs
19. L. OCallaghan et al., Streaming-data algorithms for high-quality clustering, in: Proceeding of the International Conference on Data Engineering (ICDE), 2002.
20. P. Gibbons, Distinct sampling for highly-accurate answer to distinct values queries and event reports in VLDB, 2001.
21. Platt J. Fast training of support vector machines using sequential minimal optimization. Advances in Kernel Methods: Support Vector Learning (1999), MIT Press, Cambridge, MA 185-208
22. Motwani R., Chaudhuri S., and Narasayya V. Random sampling for histogram construction: how much is enough?. SIGMOD (1998) 436-447
23. Weng J., Zhang Y., and Hwang W.S. Candid covariance-free incremental principal component analysis. IEEE Transactions of the Pattern Analysis and Machine Intelligence 25 8 (2003) 1034-1040
24. H. Wong, W. Fan, P. Yu, J. Han, Mining concept-drifting data streams using ensemble classifiers, in: Proceeding of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, 2003.
25. J. Yan, B.Y. Zhang, S.C. Yan, Z. Chen, W.G. Fan, Q. Yang, W.Y. Ma, Q.S. Cheng, IMMC: Incremental maximum marginal criterion, in: Proceeding of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Seattle, WA, USA, 2004.
26. Y. Yang, J.O. Pedersen, A comparative study on feature selection in text categorization, in: Proceeding of the 14th International Conference on Machine Learning, 1997.
27. J. Zhang et al., Modified logistic regression: an approximation to SVM and its applications in large-scale text categorization, in: Proceeding of the 20th International Conference on Machine Learning, Washington, DC, 2003.
28. Y. Zhang, J. Weng, Convergence analysis of complementary candid incremental principal component Analysis, Technical Report, MSU-CSE-01-23, Computer Science and Engineering Department of Michigan State University, August, 2001.