-
1
-
-
0003569413
-
Applying data mining techniques in text analysis
-
Tech Report C-1997-23, University of Helsinki, Department of Computer Science
-
Ahonen, H., Heinonen, O., Klemettinen, M., Verkamo, A.I.: Applying data mining techniques in text analysis. Tech Report C-1997-23, University of Helsinki, Department of Computer Science (1997)
-
(1997)
-
-
Ahonen, H.1
Heinonen, O.2
Klemettinen, M.3
Verkamo, A.I.4
-
2
-
-
35448931869
-
Discovering generalized episodes using minimal occurrences
-
Portland, Oregon, AAAI Press
-
Mannila, H., Toivonen, H.: Discovering generalized episodes using minimal occurrences. In: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD'96), Portland, Oregon, AAAI Press (1996) 146-151
-
(1996)
Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD'96)
, pp. 146-151
-
-
Mannila, H.1
Toivonen, H.2
-
3
-
-
27144468394
-
Discovery of frequent episodes in event sequences
-
Mannila, H., Toivonen, H., Verkamo, A.L: Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery 1 (1997) 259-289
-
(1997)
Data Mining and Knowledge Discovery
, vol.1
, pp. 259-289
-
-
Mannila, H.1
Toivonen, H.2
Verkamo, A.L.3
-
4
-
-
0031651027
-
Applying data mining techniques for descriptive phrase extraction in digital document collections
-
IEEE Computer Society
-
Ahonen, H., Heinonen, O., Klemettinen, M., Verkamo, A.I: Applying data mining techniques for descriptive phrase extraction in digital document collections. In: Proceedings of the Advances in Digital Libraries Conference, IEEE Computer Society (1998) 2
-
(1998)
Proceedings of the Advances in Digital Libraries Conference
, pp. 2
-
-
Ahonen, H.1
Heinonen, O.2
Klemettinen, M.3
Verkamo, A.I.4
-
7
-
-
37149054524
-
-
Aho, A.: Algorithms for finding patterns in strings. In van Leeuwen, J., ed.: Handbook of Theoretical Computer Science. A: Algorithms and Complexity. Elsevier (1990)
-
Aho, A.: Algorithms for finding patterns in strings. In van Leeuwen, J., ed.: Handbook of Theoretical Computer Science. Volume A: Algorithms and Complexity. Elsevier (1990)
-
-
-
-
8
-
-
18544377468
-
Efficient string matching on coded texts
-
Galil, Z, Ukkonen, E, eds, Espoo, Finland, Springer-Verlag, Berlin
-
Breslauer, D., Gasieniec, L.: Efficient string matching on coded texts. In Galil, Z., Ukkonen, E., eds.: Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching, Espoo, Finland, Springer-Verlag, Berlin (1995) 27-40
-
(1995)
Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching
, pp. 27-40
-
-
Breslauer, D.1
Gasieniec, L.2
-
9
-
-
0030781644
-
Fast algorithms for sorting and searching strings
-
New Orleans, Louisiana, United States, Society for Industrial and Applied Mathematics
-
Bentley, J.L., Sedgewick, R.: Fast algorithms for sorting and searching strings. In: Proceedings of the Eighth annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, Louisiana, United States, Society for Industrial and Applied Mathematics (1997) 360-369
-
(1997)
Proceedings of the Eighth annual ACM-SIAM Symposium on Discrete Algorithms
, pp. 360-369
-
-
Bentley, J.L.1
Sedgewick, R.2
-
10
-
-
0001282046
-
Incremental string comparison
-
Landau, G.M., Myers, E.W., Schmidt, J.P.: Incremental string comparison. SIAM Journal on Computing 27 (1998) 557-582
-
(1998)
SIAM Journal on Computing
, vol.27
, pp. 557-582
-
-
Landau, G.M.1
Myers, E.W.2
Schmidt, J.P.3
-
11
-
-
37149049499
-
Time warps, string edits, and macromolecules / The theory and practice of sequence comparison
-
Reissue ed. edn, Center for the Study of Language and Information, Stanford, Calif
-
Sankoff, D., Kruskal, J.B.: Time warps, string edits, and macromolecules / The theory and practice of sequence comparison. Reissue ed. edn. David Hume series. Center for the Study of Language and Information, Stanford, Calif. (1999)
-
(1999)
David Hume series
-
-
Sankoff, D.1
Kruskal, J.B.2
-
12
-
-
37149055540
-
Mining emerging substrings
-
Tech Report TR-2002-11, HKU CSIS
-
Chan, S., Kao, B., Yip, CL., Tang, M.: Mining emerging substrings. Tech Report TR-2002-11, HKU CSIS (2002)
-
(2002)
-
-
Chan, S.1
Kao, B.2
Yip, C.L.3
Tang, M.4
-
13
-
-
0033903571
-
Faster algorithms for string matching with k mismatches
-
San Francisco, California, United States, Society for Industrial and Applied Mathematics
-
Amir, A., Lewenstein, M., Porat, E.: Faster algorithms for string matching with k mismatches. In: Proceedings of the Eleventh annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, United States, Society for Industrial and Applied Mathematics (2000) 794-803
-
(2000)
Proceedings of the Eleventh annual ACM-SIAM Symposium on Discrete Algorithms
, pp. 794-803
-
-
Amir, A.1
Lewenstein, M.2
Porat, E.3
-
15
-
-
84976728067
-
The string-to-string correction problem with block moves
-
Tichy, W.F.: The string-to-string correction problem with block moves. ACM Transactions on Computer Systems (TOCS) 2 (1984) 309-321
-
(1984)
ACM Transactions on Computer Systems (TOCS)
, vol.2
, pp. 309-321
-
-
Tichy, W.F.1
-
16
-
-
0026970734
-
Edit distance of run-length coded strings
-
Kansas City, Missouri, United States, ACM Press
-
Bunke, H., Csirik, J.: Edit distance of run-length coded strings. In: Proceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing, Kansas City, Missouri, United States, ACM Press (1992) 137-143
-
(1992)
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing
, pp. 137-143
-
-
Bunke, H.1
Csirik, J.2
-
17
-
-
0029486197
-
Pattern recognition of strings with substitutions, insertions, deletions and generalized transpositions
-
Man and Cybernetics
-
Oommen, B. J., Loke, R.K.S.: Pattern recognition of strings with substitutions, insertions, deletions and generalized transpositions. In: Proceedings of the IEEE International Conference on Systems, Man and Cybernetics. Volume 2. (1995) 1154-1159
-
(1995)
Proceedings of the IEEE International Conference on Systems
, vol.2
, pp. 1154-1159
-
-
Oommen, B.J.1
Loke, R.K.S.2
-
19
-
-
0032256006
-
Approximate string matching: A simpler faster algorithm
-
San Francisco, California, United States, Society for Industrial and Applied Mathematics
-
Cole, R., Hariharan, R.: Approximate string matching: a simpler faster algorithm. In: Proceedings of the Ninth annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, United States, Society for Industrial and Applied Mathematics (1998) 463-472
-
(1998)
Proceedings of the Ninth annual ACM-SIAM Symposium on Discrete Algorithms
, pp. 463-472
-
-
Cole, R.1
Hariharan, R.2
-
22
-
-
26444481117
-
The string edit distance matching problem with moves
-
San Francisco, California, Society for Industrial and Applied Mathematics
-
Cormode, G., Muthukrishnan, S.: The string edit distance matching problem with moves. In: Proceedings of the Thirteenth annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, Society for Industrial and Applied Mathematics (2002) 667-676
-
(2002)
Proceedings of the Thirteenth annual ACM-SIAM Symposium on Discrete Algorithms
, pp. 667-676
-
-
Cormode, G.1
Muthukrishnan, S.2
-
23
-
-
0037770095
-
A sublinear algorithm for weakly approximating edit distance
-
San Diego, CA, USA, ACM Press
-
Batu, T., Ergün, F., Kilian, J., Magen, A., Raskhodnikova, S., Rubinfeld, R., Sami, R.: A sublinear algorithm for weakly approximating edit distance. In: Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing, San Diego, CA, USA, ACM Press (2003) 316-324
-
(2003)
Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing
, pp. 316-324
-
-
Batu, T.1
Ergün, F.2
Kilian, J.3
Magen, A.4
Raskhodnikova, S.5
Rubinfeld, R.6
Sami, R.7
-
24
-
-
37149024331
-
A bit-vector algorithm for computing levenshtein and damerau edit distances
-
Hyyrö, H.: A bit-vector algorithm for computing levenshtein and damerau edit distances. Nordic Journal of Computing 10 (2003) 29-39
-
(2003)
Nordic Journal of Computing
, vol.10
, pp. 29-39
-
-
Hyyrö, H.1
-
25
-
-
0345566149
-
A guided tour to approximate string matching
-
Navarro, G.: A guided tour to approximate string matching. ACM Computing Surveys 33 (2001) 31-88
-
(2001)
ACM Computing Surveys
, vol.33
, pp. 31-88
-
-
Navarro, G.1
-
28
-
-
0001893260
-
Lexical cohesion computed by thesaural relations as an indicator of the structure of text
-
Morris, J., Hirst, G.: Lexical cohesion computed by thesaural relations as an indicator of the structure of text. Computational Linguistics 17 (1991) 21-48
-
(1991)
Computational Linguistics
, vol.17
, pp. 21-48
-
-
Morris, J.1
Hirst, G.2
-
29
-
-
1842577983
-
Word sense disambiguation and text segmentation based on lexical cohesion
-
Kyoto, Japan
-
Okumura, M., Honda, T.: Word sense disambiguation and text segmentation based on lexical cohesion. In: 15th Conference on Computational Linguistics. Volume 2., Kyoto, Japan (1994) 755-761
-
(1994)
15th Conference on Computational Linguistics
, vol.2
, pp. 755-761
-
-
Okumura, M.1
Honda, T.2
-
30
-
-
84947915842
-
Dealing with semantic heterogeneity during data integration
-
Akoka, J, Mokrane, B, Comyn-Wattiau, I, Métais, E, eds, Eighteenth International Conference on Conceptual Modelling. of, Paris France, Springer
-
Kedad, Z., Métais, E.: Dealing with semantic heterogeneity during data integration. In Akoka, J., Mokrane, B., Comyn-Wattiau, I., Métais, E., eds.: Eighteenth International Conference on Conceptual Modelling. Volume 1728 of Lecture Notes in Computer Science., Paris France, Springer (1999) 325-339
-
(1999)
Lecture Notes in Computer Science
, vol.1728
, pp. 325-339
-
-
Kedad, Z.1
Métais, E.2
-
35
-
-
0012992939
-
Lexical chains as representations of context for the detection and correction of malapropisms
-
Fellbaum, C, ed, MIT Press, Cambridge, MA, USA
-
Hirst, G., St-Onge, D.: Lexical chains as representations of context for the detection and correction of malapropisms. In Fellbaum, C., ed.: WordNet: An Electronic Lexical Database. MIT Press, Cambridge, MA, USA (1998) 305-332
-
(1998)
WordNet: An Electronic Lexical Database
, pp. 305-332
-
-
Hirst, G.1
St-Onge, D.2
-
36
-
-
0027846505
-
Word sense disambiguation for free-text indexing using a massive semantic network
-
Arlington, Va, USA
-
Sussna, M.: Word sense disambiguation for free-text indexing using a massive semantic network. In: Second International Conference on Information and Knowledge Management, Arlington, Va, USA (1993) 67-74
-
(1993)
Second International Conference on Information and Knowledge Management
, pp. 67-74
-
-
Sussna, M.1
-
37
-
-
0002542095
-
Combining local context and wordnet similarity for word sense identification
-
Fellbaum, C, ed, MIT Press, Cambridge, MA, USA
-
Leacock, C., Chodorow, M.: Combining local context and wordnet similarity for word sense identification. In Fellbaum, C., ed.: WordNet: An Electronic Lexical Database. MIT Press, Cambridge, MA, USA (1998) 265-283
-
(1998)
WordNet: An Electronic Lexical Database
, pp. 265-283
-
-
Leacock, C.1
Chodorow, M.2
-
39
-
-
0002016474
-
Semantic similarity in a taxonomy: An information-based measure and its application to problems of ambiguity in natural language
-
Resnik, P.: Semantic similarity in a taxonomy: An information-based measure and its application to problems of ambiguity in natural language. Journal of Artificial Intelligence Research 11 (1999) 95-130
-
(1999)
Journal of Artificial Intelligence Research
, vol.11
, pp. 95-130
-
-
Resnik, P.1
-
41
-
-
0005180705
-
An information-theoretic definition of similarity
-
Morgan Kaufmann, San Francisco, CA
-
Lin, D.: An information-theoretic definition of similarity. Proc. 15th International Conf. on Machine Learning, Morgan Kaufmann, San Francisco, CA (1998) 296-304
-
(1998)
Proc. 15th International Conf. on Machine Learning
, pp. 296-304
-
-
Lin, D.1
-
42
-
-
0008711348
-
Using wordnet as a knowledge base for measuring semantic similarity between words
-
CA-1294, School of Computer Applications, Dublin City University
-
Richardson, R., Smeaton, A., Murphy, J.: Using wordnet as a knowledge base for measuring semantic similarity between words. Technical Report Working Paper CA-1294, School of Computer Applications, Dublin City University (1994)
-
(1994)
Technical Report Working Paper
-
-
Richardson, R.1
Smeaton, A.2
Murphy, J.3
-
45
-
-
0003637166
-
Agent communication with differentiated ontologies: Eight new measures of description compatibility
-
Technical report, Department of Electrical Engineering and Computer Science, University of Michigan
-
Weinstein, P., Birmingham, W.: Agent communication with differentiated ontologies: eight new measures of description compatibility. Technical report, Department of Electrical Engineering and Computer Science, University of Michigan (1999)
-
(1999)
-
-
Weinstein, P.1
Birmingham, W.2
-
46
-
-
0031162287
-
Association rules over interval data
-
Peckham, J, ed, Tucson, Arizona, USA, ACM Press
-
Miller, R., Yang, Y.: Association rules over interval data. In Peckham, J., ed.: ACM SIGMOD Conference on the Management of Data, Tucson, Arizona, USA, ACM Press (1997) 452-461
-
(1997)
ACM SIGMOD Conference on the Management of Data
, pp. 452-461
-
-
Miller, R.1
Yang, Y.2
-
47
-
-
84957645500
-
Putting similarity assessment into context: Matching-distance with the user's intended operations
-
Bouquet, P, Serafini, L, Brézillon, P, Benerecetti, M, Castellani, F, eds, 2nd International and Interdisciplinary Conference on Modeling and Using Context, CONTEXT-99. of, Trento, Italy, Springer
-
Rodríguez, M.A., Egenhofer, M.J.: Putting similarity assessment into context: Matching-distance with the user's intended operations. In Bouquet, P., Serafini, L., Brézillon, P., Benerecetti, M., Castellani, F., eds.: 2nd International and Interdisciplinary Conference on Modeling and Using Context, CONTEXT-99. Volume 1688 of Lecture Notes in Artificial Intelligence., Trento, Italy, Springer (1999) 310-323
-
(1999)
Lecture Notes in Artificial Intelligence
, vol.1688
, pp. 310-323
-
-
Rodríguez, M.A.1
Egenhofer, M.J.2
-
48
-
-
84957864984
-
Assessing semantic similarities among geospatial feature class definitions
-
Vckovski, A, Brassel, K, Schek, H.J, eds, Second International Conference on Interoperating Geographic Information Systems, INTEROP'99. of, Zurich, Switzerland, Springer
-
Rodriguez, M., Egenhofer, M., Rugg, R.: Assessing semantic similarities among geospatial feature class definitions. In Vckovski, A., Brassel, K., Schek, H.J., eds.: Second International Conference on Interoperating Geographic Information Systems, INTEROP'99. Volume 1580 of Lecture Notes in Computer Science., Zurich, Switzerland, Springer (1999) 189-202
-
(1999)
Lecture Notes in Computer Science
, vol.1580
, pp. 189-202
-
-
Rodriguez, M.1
Egenhofer, M.2
Rugg, R.3
-
49
-
-
17644372125
-
A unifying semantic distance model for determining the similarity of attribute values
-
Oudshoorn, M, ed, Adelaide, Australia, ACS
-
Roddick, J.F., Hornsby, K., De Vries, D.: A unifying semantic distance model for determining the similarity of attribute values. In Oudshoorn, M., ed.: 26th Australasian Computer Science Conference (ACSC2003). Volume 16., Adelaide, Australia, ACS (2003) 111-118
-
(2003)
26th Australasian Computer Science Conference (ACSC2003)
, vol.16
, pp. 111-118
-
-
Roddick, J.F.1
Hornsby, K.2
De Vries, D.3
-
50
-
-
2942564376
-
Mining relationships between interacting episodes
-
Berry, M.W, Dayal, U, Kamath, C, Skillicorn, D, eds, Lake Buena Vista, Florida, SIAM
-
Mooney, C.H., Roddick, J.F.: Mining relationships between interacting episodes. In Berry, M.W., Dayal, U., Kamath, C., Skillicorn, D., eds.: Proceedings of the Fourth SIAM International Conference on Data Mining, Lake Buena Vista, Florida, SIAM (2004)
-
(2004)
Proceedings of the Fourth SIAM International Conference on Data Mining
-
-
Mooney, C.H.1
Roddick, J.F.2
|