{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T02:01:28Z","timestamp":1783476088489,"version":"3.55.0"},"reference-count":54,"publisher":"National Academy of Sciences","issue":"51","license":[{"start":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T00:00:00Z","timestamp":1559520000000},"content-version":"vor","delay-in-days":182,"URL":"https:\/\/www.pnas.org\/site\/aboutpnas\/licenses.xhtml"}],"funder":[{"DOI":"10.13039\/100000002","name":"HHS | National Institutes of Health","doi-asserted-by":"publisher","award":["1R01DC017695"],"award-info":[{"award-number":["1R01DC017695"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.pnas.org"],"crossmark-restriction":true},"short-container-title":["Proc. Natl. Acad. Sci. U.S.A."],"published-print":{"date-parts":[[2018,12,18]]},"abstract":"<jats:title>Significance<\/jats:title>\n                  <jats:p>This work is significant for two reasons. First, considering fly olfaction in the context of a computational algorithm emphasizes features of olfactory processing that might otherwise be less apparent. For example, comparison of prior approaches for novelty detection makes clear that different odors are not just novel vs. familiar, but rather can have various degrees of novelty depending on the similarities between odors. Second, understanding how the fruit fly olfactory circuit detects novel odors can inspire new methods for similar problems in machine learning. In this way, both computer science and neuroscience benefit from the comparison of these two systems.<\/jats:p>","DOI":"10.1073\/pnas.1814448115","type":"journal-article","created":{"date-parts":[[2018,12,3]],"date-time":"2018-12-03T20:15:34Z","timestamp":1543868134000},"page":"13093-13098","update-policy":"https:\/\/doi.org\/10.1073\/pnas.cm10313","source":"Crossref","is-referenced-by-count":42,"title":["A neural data structure for novelty detection"],"prefix":"10.1073","volume":"115","author":[{"given":"Sanjoy","family":"Dasgupta","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, University of California, San Diego, La Jolla, CA 92093;"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Timothy C.","family":"Sheehan","sequence":"additional","affiliation":[{"name":"Neurosciences Graduate Program, University of California, San Diego, La Jolla, CA 92093;"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Charles F.","family":"Stevens","sequence":"additional","affiliation":[{"name":"Kavli Institute for Brain &amp; Mind, University of California, San Diego, La Jolla, CA 92093;"},{"name":"Molecular Neurobiology Laboratory, The Salk Institute for Biological Studies, La Jolla, CA 92037;"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saket","family":"Navlakha","sequence":"additional","affiliation":[{"name":"Integrative Biology Laboratory, The Salk Institute for Biological Studies, La Jolla, CA 92037"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"341","published-online":{"date-parts":[[2018,12,3]]},"reference":[{"key":"e_1_3_3_1_2","doi-asserted-by":"publisher","DOI":"10.1038\/nrn1052"},{"key":"e_1_3_3_2_2","doi-asserted-by":"crossref","unstructured":"G Koloniari N Ntarmos E Pitoura D Souravlias One is enough: Distributed filtering for duplicate elimination. Proceedings of the 20th ACM Conference on Information and Knowledge Management CIKM \u201911 . Available at https:\/\/dl.acm.org\/citation.cfm?id=2063643. Accessed April 2 2018. (2011).","DOI":"10.1145\/2063576.2063643"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00359-005-0026-0"},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","DOI":"10.1523\/JNEUROSCI.0682-12.2013"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1152\/jn.01283.2007"},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1510103112"},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.aam9868"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cell.2006.01.050"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neuron.2010.04.009"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature12063"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.7554\/eLife.04577"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neuron.2015.11.003"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.7554\/eLife.26975"},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cell.2017.04.028"},{"key":"e_1_3_3_15_2","doi-asserted-by":"crossref","unstructured":"A Kirsch M Mitzenmacher Distance-sensitive Bloom filters. Proceedings of the Meeting on Algorithm Engineering & Expermiments ALENEX \u201906 . Available at https:\/\/epubs.siam.org\/doi\/abs\/10.1137\/1.9781611972863.4. Accessed April 11 2018. (2006).","DOI":"10.1137\/1.9781611972863.4"},{"key":"e_1_3_3_16_2","doi-asserted-by":"crossref","unstructured":"P Pandey MA Bender R Johnson R Patro A general-purpose counting filter: Making every bit count. Proceedings of the ACM International Conference on Management of Data SIGMOD \u201917 . Available at https:\/\/dl.acm.org\/citation.cfm?id=3035963. Accessed April 19 2018. (2017).","DOI":"10.1145\/3035918.3035963"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2011.108"},{"key":"e_1_3_3_18_2","doi-asserted-by":"crossref","unstructured":"M Goswami R Pagh F Silvestri J Sivertsen Distance sensitive Bloom filters without false negatives. Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms SODA \u201917 . Available at https:\/\/dl.acm.org\/citation.cfm?id=3039703. Accessed May 2 2018. (2017).","DOI":"10.1137\/1.9781611974782.17"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00032-8"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2401011"},{"key":"e_1_3_3_21_2","doi-asserted-by":"crossref","unstructured":"F Deng D Rafiei Approximately detecting duplicates for streaming data using stable Bloom filters. Proceedings of the ACM International Conference on Management of Data SIGMOD \u201906 . Available at https:\/\/dl.acm.org\/citation.cfm?id=1142477. Accessed April 24 2018. (2006).","DOI":"10.1145\/1142473.1142477"},{"key":"e_1_3_3_22_2","doi-asserted-by":"crossref","unstructured":"L Zhang Y Guan Detecting click fraud in pay-per-click streams of online advertising networks. The 28th International Conference on Distributed Computing Systems 2008. ICDCS\u201908 . Available at https:\/\/ieeexplore.ieee.org\/document\/4595871. Accessed April 12 2018. (2008).","DOI":"10.1109\/ICDCS.2008.98"},{"key":"e_1_3_3_23_2","doi-asserted-by":"crossref","unstructured":"Y Zhao J Wu B-sub: A practical Bloom-filter-based publish-subscribe system for human networks. Proceedings of the 30th IEEE International Conference on Distributed Computing Systems ICDCS \u201910 . Available at https:\/\/ieeexplore.ieee.org\/document\/5541685. Accessed May 30 2018. (2010).","DOI":"10.1109\/ICDCS.2010.89"},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.1038\/srep21841"},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1716341115"},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cell.2017.05.011"},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","DOI":"10.3389\/fncom.2014.00160"},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neuron.2014.07.035"},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.3389\/fncom.2017.00111"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.1038\/nn.3660"},{"key":"e_1_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2013.12.026"},{"key":"e_1_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2003.07.019"},{"key":"e_1_3_3_33_2","doi-asserted-by":"crossref","unstructured":"C Luo A Shrivastava Arrays of (locality-sensitive) count estimators (ACE): Anomaly detection on the edge. Proceedings of the 2018 World Wide Web Conference WWW \u201918 . Available at https:\/\/dl.acm.org\/citation.cfm?id=3186056. Accessed June 8 2018. (2018).","DOI":"10.1145\/3178876.3186056"},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129096"},{"key":"e_1_3_3_35_2","doi-asserted-by":"crossref","unstructured":"J Serr\u00e0 A Karatzoglou Getting deep recommenders fit: Bloom embeddings for sparse binary input\/output networks. arXiv:1706.0399. Preprint posted June 13 2017. (2017).","DOI":"10.1145\/3109859.3109876"},{"key":"e_1_3_3_36_2","doi-asserted-by":"crossref","unstructured":"A Salvi S Ercoli M Bertini AD Bimbo Bloom filters and compact hash codes for efficient and distributed image retrieval. arXiv:1605.00957. Preprint posted May 3 2016. (2016).","DOI":"10.1109\/ISM.2016.0113"},{"key":"e_1_3_3_37_2","doi-asserted-by":"crossref","unstructured":"J Bruck J Gao A Jiang Weighted Bloom filter. IEEE International Symposium on Information Theory . Available at https:\/\/ieeexplore.ieee.org\/document\/4036381. Accessed April 22 2018. (2006).","DOI":"10.1109\/ISIT.2006.261978"},{"key":"e_1_3_3_38_2","doi-asserted-by":"crossref","unstructured":"M Zhong P Lu K Shen J Seiferas Optimizing data popularity conscious Bloom filters. Proceedings of the 27th ACM Symposium on Principles of Distributed Computing PODC \u201908 . Available at https:\/\/dl.acm.org\/citation.cfm?id=1400798. Accessed May 30 2018. (2008).","DOI":"10.1145\/1400751.1400798"},{"key":"e_1_3_3_39_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2010.12.025"},{"key":"e_1_3_3_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/90.851975"},{"key":"e_1_3_3_41_2","doi-asserted-by":"crossref","unstructured":"B Fan DG Andersen M Kaminsky MD Mitzenmacher Cuckoo filter: Practically better than Bloom. Proceedings of the 10th ACM International Conference on Emerging Networking Experiments and Technologies CoNEXT \u201914 . Available at https:\/\/dl.acm.org\/citation.cfm?id=2674005.2674994. Accessed April 2 2018. (2014).","DOI":"10.1145\/2674005.2674994"},{"key":"e_1_3_3_42_2","doi-asserted-by":"crossref","unstructured":"JL Dautrich CV Ravishankar Inferential time-decaying Bloom filters. Proceedings of the 16th International Conference on Extending Database Technology EDBT \u201913 . Available at https:\/\/dl.acm.org\/citation.cfm?id=2452376.2452405. Accessed June 4 2018. (2013).","DOI":"10.1145\/2452376.2452405"},{"key":"e_1_3_3_43_2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2487976"},{"key":"e_1_3_3_44_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"e_1_3_3_45_2","unstructured":"J Johnson M Douze H J\u00e9gou Billion-scale similarity search with GPUs. arXiv:1702.08734. Preprint posted February 28 2017. (2017)."},{"key":"e_1_3_3_46_2","first-page":"2012","volume-title":"Proceedings of the 31st Conference On Learning Theory (COLT), Proceedings of Machine Learning Research","author":"Indyk P","year":"2018","unstructured":"P Indyk, T Wagner, Approximate nearest neighbors in limited space. Proceedings of the 31st Conference On Learning Theory (COLT), Proceedings of Machine Learning Research, eds J Dy, A Krause (Proceedings of Machine Learning Research, Stockholm) Vol 75, 2012\u20132036 (2018)."},{"key":"e_1_3_3_47_2","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a006"},{"key":"e_1_3_3_48_2","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00945"},{"key":"e_1_3_3_49_2","doi-asserted-by":"publisher","DOI":"10.1016\/0169-7552(89)90019-6"},{"key":"e_1_3_3_50_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature23455"},{"key":"e_1_3_3_51_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neuron.2012.09.037"},{"key":"e_1_3_3_52_2","doi-asserted-by":"publisher","DOI":"10.1038\/383256a0"},{"key":"e_1_3_3_53_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neuroimage.2009.12.083"},{"key":"e_1_3_3_54_2","doi-asserted-by":"publisher","DOI":"10.3389\/fnsys.2014.00111"}],"container-title":["Proceedings of the National Academy of Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.pnas.org\/syndication\/doi\/10.1073\/pnas.1814448115","content-type":"unspecified","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/pnas.org\/doi\/pdf\/10.1073\/pnas.1814448115","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,13]],"date-time":"2022-04-13T03:50:56Z","timestamp":1649821856000},"score":1,"resource":{"primary":{"URL":"https:\/\/pnas.org\/doi\/full\/10.1073\/pnas.1814448115"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,3]]},"references-count":54,"journal-issue":{"issue":"51","published-print":{"date-parts":[[2018,12,18]]}},"alternative-id":["10.1073\/pnas.1814448115"],"URL":"https:\/\/doi.org\/10.1073\/pnas.1814448115","relation":{},"ISSN":["0027-8424","1091-6490"],"issn-type":[{"value":"0027-8424","type":"print"},{"value":"1091-6490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,3]]},"assertion":[{"value":"2018-12-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}