{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T18:08:03Z","timestamp":1725818883372},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319163536"},{"type":"electronic","value":"9783319163543"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-16354-3_31","type":"book-chapter","created":{"date-parts":[[2015,3,16]],"date-time":"2015-03-16T08:53:25Z","timestamp":1426496005000},"page":"284-290","source":"Crossref","is-referenced-by-count":1,"title":["MIST: Top-k Approximate Sub-string Mining Using Triplet Statistical Significance"],"prefix":"10.1007","author":[{"given":"Sourav","family":"Dutta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"31_CR1","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/rsa.10014","volume":"20","author":"R. Baeza-Yates","year":"2002","unstructured":"Baeza-Yates, R., Navarro, G.: New and Faster Filters for Multiple Approximate String Matching. Random Structures & Algorithms\u00a020(1), 23\u201349 (2002)","journal-title":"Random Structures & Algorithms"},{"key":"31_CR2","unstructured":"Baeza-Yates, R.A., Ribeiro-Neto, B.A.: Modern Information Retrieval - the Concepts and Technology behind Search. Pearson Edu. Ltd. (2011)"},{"key":"31_CR3","unstructured":"Cucerzan, S., Brill, E.: Spelling Corrections as an Interactive Process that Exploits the Collective Knowledge of Web Users. In: EMNLP, pp. 293\u2013300 (2004)"},{"key":"31_CR4","unstructured":"Deng, D., Li, G., Feng, J., Li, W.S.: Top-k string similarity search with edit-distance constraints. In: ICDE, pp. 925\u2013936 (2013)"},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-642-13657-3_35","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"S. Dutta","year":"2010","unstructured":"Dutta, S., Bhattacharya, A.: Most Significant Substring Mining based on Chi-Square Measure. In: Zaki, M.J., Yu, J.X., Ravindran, B., Pudi, V. (eds.) PAKDD 2010, Part I. LNCS, vol.\u00a06118, pp. 319\u2013327. Springer, Heidelberg (2010)"},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-642-31235-9_18","volume-title":"Scientific and Statistical Database Management","author":"D. Fenz","year":"2012","unstructured":"Fenz, D., Lange, D., Rheinl\u00e4nder, A., Naumann, F., Leser, U.: Efficient Similarity Search in Very Large String Sets. In: Ailamaki, A., Bowers, S. (eds.) SSDBM 2012. LNCS, vol.\u00a07338, pp. 262\u2013279. Springer, Heidelberg (2012)"},{"key":"31_CR7","first-page":"111","volume":"54","author":"H. Hotelling","year":"1947","unstructured":"Hotelling, H.: Multivariate Quality Control. Tech. of Statistical Analysis\u00a054, 111\u2013184 (1947)","journal-title":"Tech. of Statistical Analysis"},{"key":"31_CR8","unstructured":"Kahveci, T., Singh, A.K.: Efficient Index Structures for String Databases. In: VLDB, pp. 351\u2013360 (2001)"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Keogh, E., Lonardi, S., Chiu, B.: Finding Surprising Patterns in a Time Series Database in Linear Time and Space. In: SIGKDD, pp. 550\u2013556 (2002)","DOI":"10.1145\/775107.775128"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Kim, Y., Shim, K.: Efficient Top-k Algorithms for Approximate Substring Matching. In: SIGMOD, pp. 385\u2013396 (2013)","DOI":"10.1145\/2463676.2465324"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Kimura, M., Takasu, A., Adachi, J.: FPI: A Novel Indexing Method Using Frequent Patterns for Approximate String Searches. In: EDBT Workshops, pp. 397\u2013403 (2013)","DOI":"10.1145\/2457317.2457390"},{"issue":"4","key":"31_CR12","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1145\/146370.146380","volume":"24","author":"K. Kukich","year":"1992","unstructured":"Kukich, K.: Techniques for Automatically Correcting Words in Texts. ACM Computing Surveys\u00a024(4), 377\u2013439 (1992)","journal-title":"ACM Computing Surveys"},{"issue":"8","key":"31_CR13","first-page":"707","volume":"10","author":"V.I. Levenshtein","year":"1966","unstructured":"Levenshtein, V.I.: Binary Codes capable of Correcting Deletions, Insertions, and Reversals. Soviet Physics Doklady\u00a010(8), 707\u2013710 (1966)","journal-title":"Soviet Physics Doklady"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Li, C., Lu, J., Lu, Y.: Efficient Merging and Filtering Algorithms for Apprx. String Searches. In: ICDE, pp. 257\u2013266 (2008)","DOI":"10.1109\/ICDE.2008.4497434"},{"key":"31_CR15","unstructured":"Li, C., Wang, B., Yang, X.: VGRAM: Improving Performance of Approximate Queries on String Collections using Variable-length Grams. In: VLDB, pp. 303\u2013314 (2007)"},{"issue":"4","key":"31_CR16","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF01185432","volume":"12","author":"G. Myers","year":"1994","unstructured":"Myers, G.: A Sublinear Algorithm for Approximate Keyword Searching. Algorithmica\u00a012(4), 345\u2013374 (1994)","journal-title":"Algorithmica"},{"issue":"1","key":"31_CR17","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G. Navarro","year":"2001","unstructured":"Navarro, G.: A Guided Tour to Approximate String Matching. ACM Computing Surveys\u00a033(1), 31\u201388 (2001)","journal-title":"ACM Computing Surveys"},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"Patil, M., Cai, X., Thankachan, S.V., Shah, R., Park, S.J., Foltz, D.: Approximate String Matching by Position Restricted Alignment. In: EDBT, pp. 384\u2013391 (2013)","DOI":"10.1145\/2457317.2457388"},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"Read, T., Cressie, N.: Goodness-of-fit Stats. for Discrete Multivariate Data. Springer (1988)","DOI":"10.1007\/978-1-4612-4578-0"},{"key":"31_CR20","doi-asserted-by":"crossref","unstructured":"Yang, Z., Yu, J., Kitsuregawa, M.: Fast Algorithms for Top-k Approximate String Matching. In: AAAI, pp. 1467\u20131473 (2010)","DOI":"10.1609\/aaai.v24i1.7527"},{"key":"31_CR21","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Hadjieleftheriou, M., Ooi, B.C., Srivastava, D.: Bed-Tree: An All-purpose Index Structure for String Similarity Search based on Edit Dist. In: SIGMOD, pp. 915\u2013926 (2010)","DOI":"10.1145\/1807167.1807266"}],"container-title":["Lecture Notes in Computer Science","Advances in Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-16354-3_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T16:39:43Z","timestamp":1691512783000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-16354-3_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319163536","9783319163543"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-16354-3_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}