Combining an order-semisensitive text similarity and closest fit approach to textual missing values in knowledge discovery

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3682 LNAI, Issue , 2005, Pages 943-949

  Feng, Yi ^a   Wu, Zhaohui ^a   Zhou, Zhongmei ^a  

^a ZHEJIANG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

DATA ACQUISITION; DATA PROCESSING; INFORMATION ANALYSIS;

KNOWLEDGE DISCOVERY; TEXTUAL INFORMATION; TRADITIONAL CHINESE MEDICINE (TCM);

KNOWLEDGE ACQUISITION;

EID: 33745299746     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11552451_130     Document Type: Conference Paper

References (8)

1. V. I. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals. Doklady Akademii Nauk SSSR, 163(4), 1965.
2. A. Singhal. Modern information retrieval: a brief overview, In IEEE Data Engineering Bulletin 24(4), 35-43, 2001
3. Xuezhong Zhou, Zhaohui Wu, Wei Lu. TCMMDB: a distributed multidatabase query system and its key technique implemention. In IEEE SMC 2001, 1095-1100, vol.2, 2001
4. D. Lopresti, A. Tomkins, Block edit models for approximate string matching. Theoretical Computer Science, 181(1): 159-179, 1997
5. D. Sankoff, J. Kruskal. Timewarps, string edits, and macromolecules: the theory and practice of sequence comparison. Addison-Wesley, 1983
6. W. Grzymala-Busse et al. A comparison of three closest fit approaches to missing attribute values in preterm birth data, International journal of intelligent systems, 17, 125-134, 2002
7. S. Needleman, C. Wunsch, A general method applicable to the search for similarities in the amino acid sequences of two proteins. J. Mol. Biol. 48, 444-453, 1970
8. F. Tichy, The string-to-string correction problem with block moves, ACM Transactions on Computer Systems, 2(4): 309-321, 1984