An efficient algorithm for pattern detection and classification

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An efficient algorithm for pattern detection and classification

Full text

Pdf (472 KB)

Source

International conference on Industrial and engineering applications of artificial intelligence and expert systems archive
Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 2 table of contents

Tullahoma, Tennessee, United States

Pages: 645 - 653

Year of Publication: 1988

ISBN:0-89791-271-3

Author

F. Hadlock

Tennessee Technological Univ.

Sponsor

SIGART: ACM Special Interest Group on Artificial Intelligence

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 13, Citation Count: 0

Additional Information:

references index terms collaborative colleagues peer to peer

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/55674.55676 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	HADLOC}{, F. O. (1977), A shortest path algorithm for grid graphs, Networks 7'323- 334.
	2	tADLO~I{, F. O. (1988), Minimum Detour Methods for String or Sequence Comparison, Congressus Numerantium.
	3	HADLOCg, F. O., Minimum Detour Methods for Levenshtein Based String Classification, (submitted).
	4	HART, P. E., NELSON, N. G., and RAPHAEL, B., (1978), A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern, Vol. SSC-4, 100-107.
	5	KOHONEN, T. (1985), Median Strings. Pattern Recognition Letters, Vol. 3, No. 5, 309-314.
	6	LEVENSttTEIN, V. I. (1966), Binary codes capable of correcting deletions, insertions, and reversals. Cybernetics and Control Theory 10, 707-710.
	7	David Maier, The Complexity of Some Problems on Subsequences and Supersequences, Journal of the ACM (JACM), v.25 n.2, p.322-336, April 1978 [doi>10.1145/322063.322075]
	8	SANKOFF, D. AND KRUSKAL, G. B. (Eds.), (1983), Time warps, string edits, and macromolecules: The theory and practice of sequence comparison. Addison Wesley, Inc.
	9	Robert A. Wagner , Michael J. Fischer, The String-to-String Correction Problem, Journal of the ACM (JACM), v.21 n.1, p.168-173, Jan. 1974 [doi>10.1145/321796.321811]
	10	Esko Ukkonen, Algorithms for approximate string matching, Information and Control, v.64 n.1-3, p.100-118, Jan./Feb./March 1985 [doi>10.1016/S0019-9958(85)80046-2]