Neighbourhood Counting Metric for Sequences

Frontiers in Artificial Intelligence and Applications

Volumn 138, Issue , 2006, Pages 243-248

  Wang, Hui ^a   Liu, Chang ^a  

^a UNIVERSITY OF ULSTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

GENES;

ALL COMMON SUBSEQUENCES; BAYES CLASSIFIER; K-VALUE; K-VALUES; LONGEST COMMON SUBSEQUENCES; MEASURING SIMILARITIES; NEIGHBOURHOOD; PERFORMANCE; SEQUENCE SIMILARITY; SIMILARITY MEASURE;

NEAREST NEIGHBOR SEARCH;

EID: 51049091958     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (11)

1. L. Bergroth, H. Hakonen, and T. Raita. A survey of longest common subsequence algorithms. In SPIRE'00: Proceedings of the Seventh International Symposium on String Processing Information Retrieval, page 39. IEEE Computer Society, 2000.
2. S. Bespamyatnikh and M. Segal. Enumerating longest increasing subsequences and patience sorting. Inform. Process. Lett., 76(1-2):7-11, 2000.
3. C.L. Blake and C.J. Merz. UCI repository of machine learning databases, 1998.
4. M.L. Fredman. On computing the length of longest increasing subsequences. Discrete Mathematics, 11(1):29-35, 1975.
5. Daniel S. Hirschberg. Algorithms for the longest common subsequence problem. Journal of ACM, 24(4):664-675, 1977.
6. James W. Hunt and Thomas G. Szymanski. A fast algorithm for computing longest common subsequences. Commun. ACM, 20(5):350-353, 1977.
7. Hui Wang. Contextual probability. Journal of Telecommunications and Information Technology, 3:92-97, 2003. The paper was presented at The Second International Conference on Decision Support for Telecommunications and Information Society, Warsaw, Poland, 5-7 September 2002. The proceedings of the conference were published as a special issue of this Journal.
8. Hui Wang. Nearest neighbors by neighborhood counting. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2005. To appear.
9. Hui Wang and Werner Dubitzky. A flexible and robust similarity measure based on contextual probability. In Proceedings of 19th International Joint Conference on Artificial Intelligence (IJCAI05), pages 27-32, Edinburgh, Scotland, 30 July - 5 August 2005.
10. Hui Wang, Ivo Düntsch, Günther Gediga, and Andrzej Skowron. Hyperrelations in version space. International Journal of Approximate Reasoning, 36(3):223-241, 2004.
11. I-Hsuan Yang, Chien-Pin Huang, and Kun-Mao Chao. A fast algorithm for computing a longest common increasing subsequence. Information Processing Letters, 93(5):249-253, 2005.