The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Classification and Novel Class Detection in Concept-Drifting Data Streams under Time Constraints
Abstract
Most existing data stream classification techniques ignore one important aspect of stream data: arrival of a novel class. We address this issue and propose a data stream classification technique that integrates a novel class detection mechanism into traditional classifiers, enabling automatic detection of novel classes before the true labels of the novel class instances arrive. Novel class detection problem becomes more challenging in the presence of concept-drift, when the underlying data distributions evolve in streams. In order to determine whether an instance belongs to a novel class, the classification model sometimes needs to wait for more test instances to discover similarities among those instances. A maximum allowable wait time Tcis imposed as a time constraint to classify a test instance. Furthermore, most existing stream classification approaches assume that the true label of a data point can be accessed immediately after the data point is classified. In reality, a time delay Tlis involved in obtaining the true label of a data point since manual labeling is time consuming. We show how to make fast and correct classification decisions under these constraints and apply them to real benchmark data. Comparison with state-of-the-art stream classification techniques prove the superiority of our approach.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Nearest neighbor pattern classification
Cover, T., & Hart, P. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1053964 · Cited by 16,936
LOF: identifying density-based local outliers
Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335388 · Cited by 5,207
LOF: identifying density-based local outliers
Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335388 · Cited by 4,149
Semi-Supervised Learning Literature Survey
Zhu, X. (2005) · Minds at UW (University of Wisconsin) · Cited by 3,844
A sentimental education: sentiment analysis using subjectivity summarization based on minimum cuts
Pang, B., & Lee, L. (2004) · Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics - ACL '04 · doi:10.3115/1218955.1218990 · Cited by 3,301
Mining time-changing data streams
Hulten, G., Spencer, L., & Domingos, P. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502529 · Cited by 1,748
Novelty detection: a review—part 1: statistical approaches
Markou, M., & Singh, S. (2003) · Signal Processing · doi:10.1016/j.sigpro.2003.07.018 · Cited by 1,432
Mining concept-drifting data streams using ensemble classifiers
Wang, H., Fan, W., Yu, P. S., & Han, J. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956778 · Cited by 1,256
Self-citationFeature bagging for outlier detection
Lazarevic, A., & Kumar, V. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081891 · Cited by 656
Mining distance-based outliers in near linear time with randomization and a simple pruning rule
Bay, S. D., & Schwabacher, M. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956758 · Cited by 613
Error Correlation and Error Reduction in Ensemble Classifiers
TUMER, K., & GHOSH, J. (1996) · Connection Science · doi:10.1080/095400996116839 · Cited by 597
A new intrusion detection system using support vector machines and hierarchical clustering
Khan, L., Awad, M., & Thuraisingham, B. (2007) · The VLDB Journal · doi:10.1007/s00778-006-0002-5 · Cited by 398
Self-citationParzen-window network intrusion detectors
Yeung, D.-Y., & Chow, C. (2003) · Object recognition supported by user interaction for service robots · doi:10.1109/icpr.2002.1047476 · Cited by 277
Using additive expert ensembles to cope with concept drift
Kolter, J. Z., & Maloof, M. A. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102408 · Cited by 261
Systematic data selection to mine concept-drifting data streams
Fan, W. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014069 · Cited by 242
Topic-conditioned novelty detection
Yang, Y., Zhang, J., Carbonell, J., & Jin, C. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775150 · Cited by 232
Learning rules for anomaly detection of hostile network traffic
Mahoney, M. V., & Chan, P. K. (2003) · Third IEEE International Conference on Data Mining · doi:10.1109/icdm.2003.1250987 · Cited by 201
Mining distance-based outliers in near linear time with randomization and a simple pruning rule
Bay, S. D., & Schwabacher, M. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '03 · doi:10.1145/956755.956758 · Cited by 189
A Practical Approach to Classify Evolving Data Streams: Training with Limited Amount of Labeled Data
Masud, M. M., Gao, J., Khan, L. R., Han, J., & Thuraisingham, B. M. (2008) · Proceedings · doi:10.1109/icdm.2008.152 · Cited by 150
Self-citationMultivariate Online Anomaly Detection Using Kernel Recursive Least Squares
Ahmed, T., Coates, M., & Lakhina, A. (2007) · IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications · doi:10.1109/infcom.2007.79 · Cited by 148
On Appropriate Assumptions to Mine Data Streams: Analysis and Practice
Gao, J., Fan, W., & Han, J. (2007) · Proceedings · doi:10.1109/icdm.2007.96 · Cited by 141
Self-citationExtreme value statistics for novelty detection in biomedical signal processing
Roberts, S. (2000) · International Conference on Advances in Medical, Signal and Information Processing (MEDSIP) · doi:10.1049/cp:20000333 · Cited by 92
Integrating Novel Class Detection with Classification for Concept-Drifting Data Streams
Masud, M. M., Gao, J., Khan, L. R., Han, J., & Thuraisingham, B. M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04174-7_6 · Cited by 90
Self-citationMining Concept-Drifting and Noisy Data Streams Using Ensemble Classifiers
Ouyang, Z., Zhou, M., Wang, T., & Wu, Q. (2009) · doi:10.1109/aici.2009.153 · Cited by 77
An Empirical Bayes Approach to Detect Anomalies in Dynamic Multidimensional Arrays
Agarwal, D. (2006) · Proceedings · doi:10.1109/icdm.2005.22 · Cited by 55
Choosing an appropriate model for novelty detection
Nairac, A. (1997) · International Conference on Artificial Neural Networks · doi:10.1049/cp:19970712 · Cited by 48
Neural-Network-Based System for Novel Fault Detection in Rotating Machinery
Crupi, V., Guglielmino, E., & Milazzo, G. (2004) · Journal of Vibration and Control · doi:10.1177/1077546304043543 · Cited by 45
Weighting versus pruning in rule validation for detecting network and host anomalies
Tandon, G., & Chan, P. K. (2007) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1281192.1281267 · Cited by 40
Cited by
A survey on concept drift adaptation
Gama, J., Žliobaitė, I., Bifet, A., Pechenizkiy, M., & Bouchachia, A. (2014) · ACM Computing Surveys · doi:10.1145/2523813 · Cited by 3,735
Ensemble learning for data stream analysis: A survey
Krawczyk, B., Minku, L. L., Gama, J., Stefanowski, J., & Woźniak, M. (2017) · Information Fusion · doi:10.1016/j.inffus.2017.02.004 · Cited by 1,050
A systematic review of machine learning techniques for software fault prediction
Malhotra, R. (2015) · Applied Soft Computing · doi:10.1016/j.asoc.2014.11.023 · Cited by 620
Webb, G. I., Hyde, R., Cao, H., Nguyen, H. L., & Petitjean, F. (2016) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-015-0448-4 · Cited by 536
FUSION: An Online Method for Multistream Classification
Haque, A., Wang, Z., Chandra, S., Dong, B., Khan, L., & Hamlen, K. W. (2017) · Proceedings of the 2017 ACM on Conference on Information and Knowledge Management · doi:10.1145/3132847.3132886 · Cited by 492
Self-citation
Metadata
- Authors
- Masud, M., Gao, J., Khan, L., Han, J., & Thuraisingham, B. M.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2011-06
- Volume
- 23
- Issue
- 6
- Pages
- 859-874
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2130416896
- Cited by
- 400
- References
- 28
- FWCI
- 18.02
- Type
- journal article
- 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.