{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:47:14Z","timestamp":1750308434327,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T00:00:00Z","timestamp":1659571200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,8,4]]},"DOI":"10.1145\/3549206.3549287","type":"proceedings-article","created":{"date-parts":[[2022,10,24]],"date-time":"2022-10-24T19:26:28Z","timestamp":1666639588000},"page":"467-475","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Sample Reduction for Support Vector Data Description (SVDD) by Farthest Boundary Point Estimation (FBPE) using Gradients of Data Density"],"prefix":"10.1145","author":[{"given":"Pratyush","family":"Pareek","sequence":"first","affiliation":[{"name":"Indian Institute of Information Technology Allahabad, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aaryan","family":"Bhardwaj","sequence":"additional","affiliation":[{"name":"Indian Institute of Information Technology Allahabad, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanskar","family":"Patro","sequence":"additional","affiliation":[{"name":"Indian Institute of Information Technology Allahabad, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anirudh","family":"Arora","sequence":"additional","affiliation":[{"name":"Indian Institute of Information Technology Allahabad, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muskan Deep","family":"Kaur Maini","sequence":"additional","affiliation":[{"name":"Indian Institute of Information Technology Allahabad, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bagesh","family":"Kumar","sequence":"additional","affiliation":[{"name":"Indian Institute of Information Technology Allahabad, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"O. P.","family":"Vyas","sequence":"additional","affiliation":[{"name":"Indian Institute of Information Technology Allahabad, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,10,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"[\n  1\n  ]  Minter T. C. (1975 January). Single-class classification. In LARS Symposia (p. 54).  [1] Minter T. C. (1975 January). Single-class classification. In LARS Symposia (p. 54).","DOI":"10.5179\/benthos1970.1975.54"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(95)00049-6"},{"key":"e_1_3_2_1_3_1","unstructured":"[3]GeeksForGeeks (2022 Jan 04). Parzen Windows density estimation technique. GeeksForGeeks. https:\/\/www.geeksforgeeks.org\/parzen-windows-density-estimation-technique\/  [3]GeeksForGeeks (2022 Jan 04). Parzen Windows density estimation technique. GeeksForGeeks. https:\/\/www.geeksforgeeks.org\/parzen-windows-density-estimation-technique\/"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35428-1_31"},{"key":"e_1_3_2_1_5_1","volume-title":"Support vector method for novelty detection. Advances in neural information processing systems, 12","author":"Sch\u00f6lkopf B.","year":"1999","unstructured":"[ 5 ] Sch\u00f6lkopf , B. , Williamson , R. C. , Smola , A. , Shawe-Taylor , J. , & Platt , J. ( 1999 ). Support vector method for novelty detection. Advances in neural information processing systems, 12 . [5] Sch\u00f6lkopf, B., Williamson, R. C., Smola, A., Shawe-Taylor, J., & Platt, J. (1999). Support vector method for novelty detection. Advances in neural information processing systems, 12."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.fss.2008.01.013"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCDC.2017.7978802"},{"key":"e_1_3_2_1_8_1","volume-title":"Estimating the support of a high-dimensional distribution. Neural computation, 13(7), 1443-1471","author":"Sch\u00f6lkopf B.","year":"2001","unstructured":"[ 8 ] Sch\u00f6lkopf , B. , Platt , J. C. , Shawe-Taylor , J. , Smola , A. J. , & Williamson , R. C. ( 2001 ). Estimating the support of a high-dimensional distribution. Neural computation, 13(7), 1443-1471 . [8] Sch\u00f6lkopf, B., Platt, J. C., Shawe-Taylor, J., Smola, A. J., & Williamson, R. C. (2001). Estimating the support of a high-dimensional distribution. Neural computation, 13(7), 1443-1471."},{"key":"e_1_3_2_1_9_1","volume-title":"Support vector domain description. Pattern recognition letters, 20(11-13), 1191-1199","author":"Tax D. M.","year":"1999","unstructured":"[ 9 ] Tax , D. M. , & Duin , R. P. ( 1999 ). Support vector domain description. Pattern recognition letters, 20(11-13), 1191-1199 . [9] Tax, D. M., & Duin, R. P. (1999). Support vector domain description. Pattern recognition letters, 20(11-13), 1191-1199."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2019.08.002"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2015.10.097"},{"key":"e_1_3_2_1_12_1","unstructured":"[\n  12\n  ]  Rohith Gandhi (2018 Jun 7). Support Vector Machine \u2014 Introduction to Machine Learning Algorithms. Towards Data Science. https:\/\/towardsdatascience.com\/support-vector-machine-introduction-to-machine-learning-algorithms-934a444fca47  [12] Rohith Gandhi (2018 Jun 7). Support Vector Machine \u2014 Introduction to Machine Learning Algorithms. Towards Data Science. https:\/\/towardsdatascience.com\/support-vector-machine-introduction-to-machine-learning-algorithms-934a444fca47"},{"key":"e_1_3_2_1_13_1","first-page":"3199","volume-title":"Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No. 03EX693)","author":"Liu Y. G.","year":"2003","unstructured":"[ 13 ] Liu , Y. G. , Chen , Q. , & Yu , R. Z. ( 2003 , November). Extract candidates of support vector from training set . In Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No. 03EX693) (Vol. 5, pp. 3199 - 3202 ). IEEE. [13] Liu, Y. G., Chen, Q., & Yu, R. Z. (2003, November). Extract candidates of support vector from training set. In Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No. 03EX693) (Vol. 5, pp. 3199-3202). IEEE."},{"key":"e_1_3_2_1_14_1","volume-title":"Sequential minimal optimization: A fast algorithm for training support vector machines","author":"Platt J.","year":"1998","unstructured":"[ 14 ] Platt , J. ( 1998 ). Sequential minimal optimization: A fast algorithm for training support vector machines . [14] Platt, J. (1998). Sequential minimal optimization: A fast algorithm for training support vector machines."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2020.01.004"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/tsmcc.2012.2196794"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2012.01.019"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5120\/15932-5157"},{"key":"e_1_3_2_1_20_1","volume-title":"Feature selection has a large impact on one-class classification accuracy for MicroRNAs in plants. Advances in bioinformatics","author":"Yousef M.","year":"2016","unstructured":"[ 20 ] Yousef , M. , Sa\u00e7ar Demirci , M. D. , Khalifa , W. , & Allmer , J. ( 2016 ). Feature selection has a large impact on one-class classification accuracy for MicroRNAs in plants. Advances in bioinformatics , 2016. [20] Yousef, M., Sa\u00e7ar Demirci, M. D., Khalifa, W., & Allmer, J. (2016). Feature selection has a large impact on one-class classification accuracy for MicroRNAs in plants. Advances in bioinformatics, 2016."},{"key":"e_1_3_2_1_21_1","volume-title":"Selecting training points for one-class support vector machines. Pattern recognition letters, 32(11), 1517-1522","author":"Li Y.","year":"2011","unstructured":"[ 21 ] Li , Y. ( 2011 ). Selecting training points for one-class support vector machines. Pattern recognition letters, 32(11), 1517-1522 . [21] Li, Y. (2011). Selecting training points for one-class support vector machines. Pattern recognition letters, 32(11), 1517-1522."},{"key":"e_1_3_2_1_22_1","unstructured":"[\n  22\n  ]  Kumar B. Shukla A. Singh A. Ali M. J. & Vyas O. P. Reduction of Training Data from Large Datasets Using Encoder and Decoder Algorithm Without Much Compromise of Accuracy. Available at SSRN 3985435.  [22] Kumar B. Shukla A. Singh A. Ali M. J. & Vyas O. P. Reduction of Training Data from Large Datasets Using Encoder and Decoder Algorithm Without Much Compromise of Accuracy. Available at SSRN 3985435."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.3906\/elk-1307-137"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.12.057"},{"issue":"3","key":"e_1_3_2_1_25_1","first-page":"57","article-title":"Reducing the number of training samples for fast support vector machine classification","volume":"2","author":"Koggalage R.","year":"2004","unstructured":"[ 25 ] Koggalage , R. , & Halgamuge , S. ( 2004 ). Reducing the number of training samples for fast support vector machine classification . Neural Information Processing-Letters and Reviews , 2 ( 3 ), 57 - 65 . [25] Koggalage, R., & Halgamuge, S. (2004). Reducing the number of training samples for fast support vector machine classification. Neural Information Processing-Letters and Reviews, 2(3), 57-65.","journal-title":"Neural Information Processing-Letters and Reviews"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2015.08.104"},{"key":"e_1_3_2_1_27_1","unstructured":"[\n  27\n  ]  Javatpoint (n.d.) Concept of Edge Detection. Javatpoint. Retrieved May 16 2022 from https:\/\/www.javatpoint.com\/dip-concept-of-edge-detection  [27] Javatpoint (n.d.) Concept of Edge Detection. Javatpoint. Retrieved May 16 2022 from https:\/\/www.javatpoint.com\/dip-concept-of-edge-detection"},{"key":"e_1_3_2_1_28_1","unstructured":"[\n  28\n  ]  GeeksForGeeks (2022 March 25). Binary Search. GeeksForGeeks. https:\/\/www.geeksforgeeks.org\/binary-search\/  [28] GeeksForGeeks (2022 March 25). Binary Search. GeeksForGeeks. https:\/\/www.geeksforgeeks.org\/binary-search\/"},{"key":"e_1_3_2_1_29_1","unstructured":"[\n  29\n  ]  GeeksForGeeks (2018 Nov 28). upperbound in C++. GeeksForGeeks. https:\/\/www.geeksforgeeks.org\/upper-bound-in-cpp\/?ref=gcse  [29] GeeksForGeeks (2018 Nov 28). upperbound in C++. GeeksForGeeks. https:\/\/www.geeksforgeeks.org\/upper-bound-in-cpp\/?ref=gcse"},{"key":"e_1_3_2_1_30_1","unstructured":"[\n  30\n  ]  Marius H. (2020 Jun 15). Tree algorithms explained: Ball Tree Algorithm vs. KD Tree vs. Brute Force. Towards Data Science. https:\/\/towardsdatascience.com\/tree-algorithms-explained-ball-tree-algorithm-vs-kd-tree-vs-brute-force-9746debcd940  [30] Marius H. (2020 Jun 15). Tree algorithms explained: Ball Tree Algorithm vs. KD Tree vs. Brute Force. Towards Data Science. https:\/\/towardsdatascience.com\/tree-algorithms-explained-ball-tree-algorithm-vs-kd-tree-vs-brute-force-9746debcd940"},{"key":"e_1_3_2_1_31_1","unstructured":"[\n  31\n  ]  Scikit Learn. (n.d.) sklearn.preprocessing.StandardScaler. Scikit learn. https:\/\/scikit-learn.org\/stable\/modules\/generated\/sklearn.preprocessing.StandardScaler.html  [31] Scikit Learn. (n.d.) sklearn.preprocessing.StandardScaler. Scikit learn. https:\/\/scikit-learn.org\/stable\/modules\/generated\/sklearn.preprocessing.StandardScaler.html"}],"event":{"name":"IC3-2022: 2022 Fourteenth International Conference on Contemporary Computing","acronym":"IC3-2022","location":"Noida India"},"container-title":["Proceedings of the 2022 Fourteenth International Conference on Contemporary Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3549206.3549287","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3549206.3549287","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:49:51Z","timestamp":1750268991000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3549206.3549287"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,4]]},"references-count":31,"alternative-id":["10.1145\/3549206.3549287","10.1145\/3549206"],"URL":"https:\/\/doi.org\/10.1145\/3549206.3549287","relation":{},"subject":[],"published":{"date-parts":[[2022,8,4]]},"assertion":[{"value":"2022-10-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}