ACM Home Page
Please provide us with feedback. Feedback
Trading MIPS and memory for knowledge engineering
Full text PdfPdf (7.46 MB)
Source
Communications of the ACM archive
Volume 35 ,  Issue 8  (August 1992) table of contents
Pages: 48 - 64  
Year of Publication: 1992
ISSN:0001-0782
Authors
Robert H. Creecy  U.S. Bureau of the Census, Washington, DC
Brij M. Masand  Thinking Machines Corp., Cambridge, MA
Stephen J. Smith  Thinking Machines Corp., Cambridge, MA
David L. Waltz  Thinking Machines Corp., Cambridge, MA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 27,   Citation Count: 28
Additional Information:

references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/135226.135228
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
 
2
Anderberg, M.Cluster Analysis for Applicatins. Academic Press, New York, 1973.
 
3
Appel, M. Automated industry and occupation coding. Development of Statistical Tools Seminar on Development of Statistical Expert Systems (DOSES), Luxembourg./, Dec- 1987.
 
4
AppeI, M.V. and Hellerman, E. census Bureau expeiments with automated industry and occupation coding. In Proceedings' American Statistical Association, (1983), 32-40.
 
5
Appet, M.V. and Scopp, T. Automdated industry and occupatin coding. Presented at Development of Statistical Expert Systems (DOSES), Luxembourg, Dec. 1987.
 
6
 
7
Chcn, B.C., Creecy, R.H. and Appel, M.V. On error control in automated industry and occupation coding. In Proceedings American Statistical Association, Survey Methods Section. (1991), to appear.
 
8
Church, K. A stochastic parts program and noun phrase parser for unrestricted text, Unpubished, cd manuscript, AT&T Bell Labs, Murray Hill, N.J., 1986.
 
9
Church, K. ami Gale, W. Enhanced Good:Turing and Cal-Cal: Two new methods for estimating Probabilities of English Bigrams. AT&T Bell Laboratories, I989.
 
10
Corbett, ,I.P. Encoding from Free Word Descriptions. Draft Mcmorandum, Bureau of the Census, 1972.
 
11
Cover, T.M. and Hart, P.E. Nearest neighbor pattern classification. IEEE Trans. Inform. Theor, 13, (1967), 21-27.
 
12
Creecy, R.H., Causey, B.D and AppeI, M,V. A bayesian ctassificadon approach to. automated industry and occupation coding., In Pro-. ceedings of American Statistical Axsocmtion, Statistical Computing Section, (1990).
 
13
Dasrathy, B,V,, .Ed, Nearest: Neighbor (NN) Norms: NN Pattern: Classification Tchniques, IEEE Computer Society Press, 1990.
 
14
Dempster, A.P, A generalization of' Bayesian. inference. J., Royal Statisti - cal Sot,, Series B. 30, (1968), 205- 1247.
 
15
Fukunaga, K. and Flick, 'T.E. An optimal global nearest neighbor" metric. IEEE Trans. Pattern Anal. Machnine Intell., Vol. PAMI-6, 3 (May 1984), 314-318.
 
16
Harman, D. How effctive is suffixing. J. Amer. Soc. Inform. Sci 42, 1 1997), 7-15.
 
17
 
18
Lorigny, J. Quid. A general automarie coding method. Surv, Method, 14, 52 (.1988), 289--298.
 
19
Lyberg, L. and Dean. P. InternationaI review of approaches to automated industry and occupation coding. Presented at the Advanced computing in the Social Sciences conference, Wiliamsburg, Apr 1987, (1990).
20
 
21
 
22
Quinlan, R, Learning efficient classification procedures and their application to chess end games, In R.S, Michalski, J. Carbonel, and R. Mitchell, Eds./, machnine Learnign: An Artificial Intelligence Approach. Tioga Publishinbg, Los Angeles, Calif. (1983), 463-482.
 
23
Rumelhart, C., et. al. Parallel Distributed procesign. MIT Press, Cambridge, Mass. I986.
 
24
 
25
Short, R.D. and Fukunaga, K. The optimal distance measure for nearest neighbor classificationn. IEEE Trans. Infor. Theor., Vol. IT-27, 5, (Sept., 198I), 622-627.
26
 
27
Stanfill, C,. amt Waltz, D,L. The memory-nased reasoning paradigm. In Proceedings of Case-Based Reasoning Workshop, Clearwater Beach FL., (May 1988),414-424.
28
 
29
Waltz. D.L. Massively Parallel AI. In Proceedings of National Conference on AI., (AAAI '90), Boston, Mass., (Aug, 1990),
 
30
Waltz, D.I. Memory-based Reasoning. In Eds. Arbib and .J.A. Robinson, Eds.. Natural and Artificial Parallel Computation, The MIT Press.. Cambridge, Mass.. (1990), '251- 276.
 
31
 
32

CITED BY  28


REVIEW

"Richard L. Frautschi : Reviewer"

Developed for the US Census Bureau, the Parallel Automated Coding Expert (PACE) uses an empirical learning model called memory-based reasoning (MBR). It aims to replace the Automated Industry and Occupation Coding System (AIOCS) developed for   more...

Collaborative Colleagues:
Robert H. Creecy: colleagues
Brij M. Masand: colleagues
Stephen J. Smith: colleagues
David L. Waltz: colleagues