{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:47:03Z","timestamp":1725536823716},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041792"},{"type":"electronic","value":"9783642041808"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04180-8_56","type":"book-chapter","created":{"date-parts":[[2009,8,27]],"date-time":"2009-08-27T08:11:20Z","timestamp":1251360680000},"page":"596-611","source":"Crossref","is-referenced-by-count":5,"title":["Mining Peculiar Compositions of Frequent Substrings from Sparse Text Data Using Background Texts"],"prefix":"10.1007","author":[{"given":"Daisuke","family":"Ikeda","sequence":"first","affiliation":[]},{"given":"Einoshin","family":"Suzuki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"56_CR1","first-page":"1","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"U.M. Fayyad","year":"1996","unstructured":"Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P.: From Data Mining to Knowledge Discovery: An Overview. In: Advances in Knowledge Discovery and Data Mining, pp. 1\u201334. AAAI\/MIT Press, Menlo Park, Calif (1996)"},{"key":"56_CR2","unstructured":"Knorr, E.M., Ng, R.T.: Finding Intensional Knowledge of Distance-Based Outliers. In: 25th International Conference on Very Large Data Bases, pp. 211\u2013222 (1999)"},{"key":"56_CR3","doi-asserted-by":"crossref","unstructured":"Padmanabhan, B., Tuzhilin, A.: Small is Beautiful: Discovering the Minimal Set of Unexpected Patterns. In: Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 54\u201363 (2000)","DOI":"10.1145\/347090.347103"},{"key":"56_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/BFb0100984","volume-title":"Advances in Database Technology - EDBT \u201998","author":"S. Sarawagi","year":"1998","unstructured":"Sarawagi, S., Agrawal, R., Megiddo, N.: Discovery-Driven Exploration of OLAP Data Cubes. In: Schek, H.-J., Saltor, F., Ramos, I., Alonso, G. (eds.) EDBT 1998. LNCS, vol.\u00a01377, pp. 168\u2013182. Springer, Heidelberg (1998)"},{"key":"56_CR5","doi-asserted-by":"crossref","unstructured":"Ide, T., Inoue, K.: Knowledge Discovery from Heterogeneous Dynamic Systems using Change-Point Correlations. In: 2005 SIAM International Conference on Data Mining, pp. 571\u2013576 (April 2005)","DOI":"10.1137\/1.9781611972757.63"},{"key":"56_CR6","doi-asserted-by":"crossref","unstructured":"Keogh, E., Lonardi, S., Chiu, B.Y.: Finding Surprising Patterns in a Time Series Database in Linear Time and Space. In: Eighth International Conference on Knowledge Discovery and Data Mining, pp. 550\u2013556 (2002)","DOI":"10.1145\/775047.775128"},{"issue":"1\/2","key":"56_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1089\/10665270050081397","volume":"7","author":"A. Apostolico","year":"2000","unstructured":"Apostolico, A., Bock, M.E., Lonardi, S., Xu, X.: Efficient Detection of Unusual Words. Journal of Computational Biology\u00a07(1\/2), 71\u201394 (2000)","journal-title":"Journal of Computational Biology"},{"issue":"3","key":"56_CR8","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1089\/cmb.1996.3.345","volume":"3","author":"M.Y. Leung","year":"1996","unstructured":"Leung, M.Y., Marsh, G.M., Speed, T.P.: Over- and Underrepresentation of Short DNA Words in Herpesvirus Genomes. Journal of Computational Biology\u00a03(3), 345\u2013360 (1996)","journal-title":"Journal of Computational Biology"},{"key":"56_CR9","series-title":"Chapman & Hall Crc Mathematical & Computational Biology Series","doi-asserted-by":"publisher","DOI":"10.1201\/9781420010732","volume-title":"Pattern Discovery in Bioinformatics: Theory & Algorithms","author":"L. Parida","year":"2007","unstructured":"Parida, L.: Pattern Discovery in Bioinformatics: Theory & Algorithms. Chapman & Hall Crc Mathematical & Computational Biology Series. Chapman & Hall\/CRC, Boca Raton (2007)"},{"issue":"2","key":"56_CR10","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1089\/cmb.1997.4.189","volume":"4","author":"S. Schbath","year":"1997","unstructured":"Schbath, S.: An Efficient Statistic to Detect Over- and Under-represented Words in DNA Sequences. Journal of Computational Biology\u00a04(2), 189\u2013192 (1997)","journal-title":"Journal of Computational Biology"},{"key":"56_CR11","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/3-540-49381-6_6","volume-title":"Algorithms and Computation","author":"H. Arimura","year":"1998","unstructured":"Arimura, H., Shimozono, S.: Maximizing agreement with a classification by bounded or unbounded number of associated words. In: Chwa, K.-Y., Ibarra, O.H. (eds.) ISAAC 1998. LNCS (LNAI), vol.\u00a01533, pp. 39\u201348. Springer, Heidelberg (1998)"},{"key":"56_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-46846-3_13","volume-title":"Discovery Science","author":"D. Ikeda","year":"1999","unstructured":"Ikeda, D.: Characteristic Sets of Strings Common to Semi-structured Documents. In: Arikawa, S., Furukawa, K. (eds.) DS 1999. LNCS (LNAI), vol.\u00a01721, pp. 139\u2013147. Springer, Heidelberg (1999)"},{"key":"56_CR13","unstructured":"Ji, X., Bailey, J., Dong, G.: Mining Minimal Distinguishing Subsequence Patterns with Gap Constraints. In: Fifth IEEE International Conference on Data Mining, pp. 194\u2013201 (2005)"},{"key":"56_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/3-540-58325-4_195","volume-title":"Algorithms and Computation","author":"M. Nakanishi","year":"1994","unstructured":"Nakanishi, M., Hashidume, M., Ito, M., Hashimoto, A.: A Linear-Time Algorithm for Computing Characteristic Strings. In: Du, D.-Z., Zhang, X.-S. (eds.) ISAAC 1994. LNCS, vol.\u00a0834, pp. 315\u2013323. Springer, Heidelberg (1994)"},{"key":"56_CR15","unstructured":"Suzuki, E.: Autonomous Discovery of Reliable Exception Rules. In: Third International Conference on Knowledge Discovery and Data Mining, pp. 259\u2013262 (1997)"},{"issue":"8","key":"56_CR16","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1142\/S0218001402002155","volume":"16","author":"E. Suzuki","year":"2002","unstructured":"Suzuki, E.: Undirected Discovery of Interesting Exception Rules. International Journal of Pattern Recognition and Artificial Intelligence\u00a016(8), 1065\u20131086 (2002)","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"},{"key":"56_CR17","unstructured":"Suzuki, E., Shimura, M.: Exceptional Knowledge Discovery in Databases Based on Information Theory. In: Second International Conference Knowledge Discovery and Data Mining, pp. 275\u2013278 (1996)"},{"key":"56_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/3-540-45571-X_26","volume-title":"Knowledge Discovery and Data Mining. Current Issues and New Applications","author":"E. Suzuki","year":"2000","unstructured":"Suzuki, E., Tsumoto, S.: Evaluating Hypothesis-Driven Exception-Rule Discovery with Medical Data Sets. In: Terano, T., Chen, A.L.P. (eds.) PAKDD 2000. LNCS, vol.\u00a01805, pp. 208\u2013211. Springer, Heidelberg (2000)"},{"key":"56_CR19","doi-asserted-by":"crossref","unstructured":"Wang, J., Han, J., Pei, J.: CLOSET+: Searching for the Best Strategies for Mining Frequent Closed Itemsets. In: 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 236\u2013245 (2003)","DOI":"10.1007\/3-540-36175-8"},{"key":"56_CR20","doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J., Afshar, R.: CloSpan: Mining Closed Sequential Patterns in Large Databases. In: The 4th SIAM International Conference on Data Mining (May 2003)","DOI":"10.1137\/1.9781611972733.15"},{"issue":"2","key":"56_CR21","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight, E.M.: A Space-Economical Suffix Tree Construction Algorithm. Journal of the ACM\u00a023(2), 262\u2013272 (1976)","journal-title":"Journal of the ACM"},{"issue":"3","key":"56_CR22","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-line Construction of Suffix Trees. Algorithmica\u00a014(3), 249\u2013260 (1995)","journal-title":"Algorithmica"},{"key":"56_CR23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees and Sequence","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees and Sequence. Cambridge University Press, New York (1997)"},{"key":"56_CR24","doi-asserted-by":"crossref","unstructured":"Jagadish, H.V., Ng, R.T., Srivastava, D.: Substring Selectivity Estimation. In: Eighteenth Symposium on Principles of Database Systems, pp. 249\u2013260 (1999)","DOI":"10.1145\/303976.304001"},{"key":"56_CR25","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-88411-8_30","volume-title":"Discovery Science","author":"T. Uemura","year":"2008","unstructured":"Uemura, T., Ikeda, D., Arimura, H.: Unsupervised Spam Detection by Document Complexity Estimation. In: Boulicaut, J.-F., Berthold, M.R., Horv\u00e1th, T. (eds.) DS 2008. LNCS (LNAI), vol.\u00a05255, pp. 319\u2013331. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04180-8_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T06:21:27Z","timestamp":1558506087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04180-8_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041792","9783642041808"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04180-8_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}