The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Classifying large data sets using SVMs with hierarchical clusters
Abstract
Support vector machines (SVMs) have been promising methods for classification and regression analysis because of their solid mathematical foundations which convery several salient properties that other methods hardly provide. However, despite the prominent properties of SVMs, they are not as favored for large-scale data mining as for pattern recognition or machine learning because the training complexity of SVMs is highly dependent on the size of a data set. Many real-world data mining applications involve millions or billions of data records where even multiple scans of the entire data are too expensive to perform. This paper presents a new method, Clustering-Based SVM (CB-SVM), which is specifically designed for handling very large data sets. CB-SVM applies a hierarchical micro-clustering algorithm that scans the entire data set only once to provide an SVM with high quality samples that carry the statistical summaries of the data such that the summaries maximize the benefit of learning the SVM. CB-SVM tries to generate the best SVM boundary for very large data sets given limited amount of resources. Our experiments on synthetic and real data sets show that CB-SVM is highly scalable for very large data sets while also generating high classification accuracy.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
A Tutorial on Support Vector Machines for Pattern Recognition
Burges, C. J. C. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009715923555 · Cited by 16,429
A tutorial on support vector regression
Smola, A. J., & Schölkopf, B. (2004) · Statistics and Computing · doi:10.1023/b:stco.0000035301.49549.88 · Cited by 13,387
Text categorization with Support Vector Machines: Learning with many relevant features
Joachims, T. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0026683 · Cited by 7,999
Fast Training of Support Vector Machines Using Sequential Minimal Optimization
Platt, J. C. (1998) · Advances in Kernel Methods · doi:10.7551/mitpress/1130.003.0016 · Cited by 5,437
BIRCH: an efficient data clustering method for very large databases
Zhang, T., Ramakrishnan, R., & Livny, M. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233324 · Cited by 3,935
A TUTORIAL ON SUPPORT VECTOR MACHINES FOR PATTERN RECOGNITION, DATA MINING AND KNOWLEDGE DISCOVERY
Burger, C. J. C. (1998) · Cited by 3,313
When Is ''Nearest Neighbor'' Meaningful?
Beyer, K., Goldstein, J., Ramakrishnan, R., & Shaft, U. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49257-7_15 · Cited by 2,403
Chameleon: hierarchical clustering using dynamic modeling
Karypis, G., Han, E.-H., & Kumar, V. (1999) · Computer · doi:10.1109/2.781637 · Cited by 2,097
CURE: an efficient clustering algorithm for large databases
Guha, S., Rastogi, R., & Shim, K. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276312 · Cited by 1,907
Making Large-Scale Support Vector Machine Learning Practical
Joachims, T. (1998) · Advances in Kernel Methods · doi:10.7551/mitpress/1130.003.0015 · Cited by 1,613
Incremental and Decremental Support Vector Machine Learning
Cauwenberghs, G., & Poggio, T. (2000) · neural information processing systems · Cited by 1,377
Proximal support vector machine classifiers
Fung, G., & Mangasarian, O. L. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502527 · Cited by 842
Less is More: Active Learning with Support Vector Machines
Schohn, G., & Cohn, D. A. (2000) · Cited by 773
RSVM: Reduced Support Vector Machines
Lee, Y.-J., & Mangasarian, O. L. (2001) · Proceedings of the 2001 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972719.13 · Cited by 647
Incremental learning with support vector machines
Ruping, S. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989589 · Cited by 524
Text categorization with support vector machines
Joachims, T. (1997) · Technische Universität Dortmund Eldorado (Technische Universität Dortmund) · doi:10.17877/de290r-5097 · Cited by 507
Training v-Support Vector Classifiers: Theory and Algorithms
Chang, C.-C., & Lin, C.-J. (2001) · Neural Computation · doi:10.1162/089976601750399335 · Cited by 499
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/15324430152733142 · Cited by 385
Support Vector Machine Active Learning with Application sto Text Classification
Tong, S., & Koller, D. (2000) · International Conference on Machine Learning · Cited by 369
Mining top-n local outliers in large databases
Jin, W., Tung, A. K. H., & Han, J. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502554 · Cited by 328
Self-citationPEBL: positive example based learning for Web page classification using SVM
Yu, H., Han, J., & Chang, K. C.-C. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775083 · Cited by 276
Self-citationKivinen, J., Smola, A. J., & Williamson, R. C. (2002) · The MIT Press eBooks · doi:10.7551/mitpress/1120.003.0105 · Cited by 103
Balcázar, J., Dai, Y., & Watanabe, O. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45583-3_11 · Cited by 71
Provably Fast Training Algorithms for Support Vector Machines
Balcázar, J. L., Dai, Y., Tanaka, J., & Watanabe, O. (2002) · Theory of Computing Systems · doi:10.1007/s00224-007-9094-6 · Cited by 52
(1998)
Cited by
A comprehensive survey on support vector machine classification: Applications, challenges and trends
Cervantes, J., Garcia-Lamont, F., Rodríguez-Mazahua, L., & Lopez, A. (2020) · Neurocomputing · doi:10.1016/j.neucom.2019.10.118 · Cited by 2,381
Support vector machine applications in the field of hydrology: A review
Raghavendra. N, S., & Deka, P. C. (2014) · Applied Soft Computing · doi:10.1016/j.asoc.2014.02.002 · Cited by 780
Mutual information-based feature selection for intrusion detection systems
Amiri, F., Rezaei Yousefi, M., Lucas, C., Shakery, A., & Yazdani, N. (2011) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2011.01.002 · Cited by 471
A novel intrusion detection system based on hierarchical clustering and support vector machines
Horng, S.-J., Su, M.-Y., Chen, Y.-H., Kao, T.-W., Chen, R.-J., Lai, J.-L., & Perkasa, C. D. (2011) · Expert Systems with Applications · doi:10.1016/j.eswa.2010.06.066 · Cited by 460
Selecting training sets for support vector machines: a review
Nalepa, J., & Kawulok, M. (2019) · Artificial Intelligence Review · doi:10.1007/s10462-017-9611-1 · Cited by 419
Metadata
- Authors
- Yu, H., Yang, J., & Han, J.
- Venue
- Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2003-08-24
- Pages
- 306-315
- OpenAlex
- W1965059296
- Cited by
- 273
- References
- 26
- FWCI
- 8.10
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.