12601
|
Cooke T, Peake M. The Optimal Classification Using a Linear Discriminant for Two Point Classes Having Known Mean and Covariance. J MULTIVARIATE ANAL 2002. [DOI: 10.1006/jmva.2001.2035] [Citation(s) in RCA: 14] [Impact Index Per Article: 0.6] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/22/2022]
|
12602
|
|
12603
|
Movellan JR, Mineiro P, Williams RJ. A Monte Carlo EM approach for partially observable diffusion processes: theory and applications to neural networks. Neural Comput 2002; 14:1507-44. [PMID: 12079544 DOI: 10.1162/08997660260028593] [Citation(s) in RCA: 14] [Impact Index Per Article: 0.6] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/04/2022]
Abstract
We present a Monte Carlo approach for training partially observable diffusion processes. We apply the approach to diffusion networks, a stochastic version of continuous recurrent neural networks. The approach is aimed at learning probability distributions of continuous paths, not just expected values. Interestingly, the relevant activation statistics used by the learning rule presented here are inner products in the Hilbert space of square integrable functions. These inner products can be computed using Hebbian operations and do not require backpropagation of error signals. Moreover, standard kernel methods could potentially be applied to compute such inner products. We propose that the main reason that recurrent neural networks have not worked well in engineering applications (e.g., speech recognition) is that they implicitly rely on a very simplistic likelihood model. The diffusion network approach proposed here is much richer and may open new avenues for applications of recurrent neural networks. We present some analysis and simulations to support this view. Very encouraging results were obtained on a visual speech recognition task in which neural networks outperformed hidden Markov models.
Collapse
Affiliation(s)
- Javier R Movellan
- Machine Perception Laboratory, Institute for Neural Computation, University of California, San Diego, La Jolla, CA 92093, USA.
| | | | | |
Collapse
|
12604
|
|
12605
|
|
12606
|
Kramer S, Frank E, Helma C. Fragment generation and support vector machines for inducing SARs. SAR AND QSAR IN ENVIRONMENTAL RESEARCH 2002; 13:509-523. [PMID: 12442768 DOI: 10.1080/10629360290023340] [Citation(s) in RCA: 15] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/24/2023]
Abstract
We present a new approach to the induction of SARs based on the generation of structural fragments and support vector machines (SVMs). It is tailored for bio-chemical databases, where the examples are two-dimensional descriptions of chemical compounds. The fragment generator finds all fragments (i.e. linearly connected atoms) that satisfy user-specified constraints regarding their frequency and generality. In this paper, we are querying for fragments within a minimum and a maximum frequency in the dataset. After fragment generation, we propose to apply SVMs to the problem of inducing SARs from these fragments. We conjecture that the SVMs are particularly useful in this context, as they can deal with a large number of features. Experiments in the domains of carcinogenicity and mutagenicity prediction show that the minimum and the maximum frequency queries for fragments can be answered within a reasonable time, and that the predictive accuracy obtained using these fragments is satisfactory. However, further experiments will have to confirm that this is a viable approach to inducing SARs.
Collapse
Affiliation(s)
- S Kramer
- Institute for Computer Science, Machine Learning Lab, Albert-Ludwigs-University Freiburg, Germany.
| | | | | |
Collapse
|
12607
|
Holmes CC, Adams NM. A probabilistic nearest neighbour method for statistical pattern recognition. J R Stat Soc Series B Stat Methodol 2002. [DOI: 10.1111/1467-9868.00338] [Citation(s) in RCA: 99] [Impact Index Per Article: 4.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/30/2022]
|
12608
|
|
12609
|
|
12610
|
|
12611
|
Sun Y, Zhu Q, Chen Z. An iterative initial-points refinement algorithm for categorical data clustering. Pattern Recognit Lett 2002. [DOI: 10.1016/s0167-8655(01)00163-5] [Citation(s) in RCA: 49] [Impact Index Per Article: 2.2] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/26/2022]
|
12612
|
Kjems U, Hansen LK, Anderson J, Frutiger S, Muley S, Sidtis J, Rottenberg D, Strother SC. The quantitative evaluation of functional neuroimaging experiments: mutual information learning curves. Neuroimage 2002; 15:772-86. [PMID: 11906219 DOI: 10.1006/nimg.2001.1033] [Citation(s) in RCA: 53] [Impact Index Per Article: 2.4] [Reference Citation Analysis] [Abstract] [MESH Headings] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/22/2022] Open
Abstract
Learning curves are presented as an unbiased means for evaluating the performance of models for neuroimaging data analysis. The learning curve measures the predictive performance in terms of the generalization or prediction error as a function of the number of independent examples (e.g., subjects) used to determine the parameters in the model. Cross-validation resampling is used to obtain unbiased estimates of a generic multivariate Gaussian classifier, for training set sizes from 2 to 16 subjects. We apply the framework to four different activation experiments, in this case [(15)O]water data sets, although the framework is equally valid for multisubject fMRI studies. We demonstrate how the prediction error can be expressed as the mutual information between the scan and the scan label, measured in units of bits. The mutual information learning curve can be used to evaluate the impact of different methodological choices, e.g., classification label schemes, preprocessing choices. Another application for the learning curve is to examine the model performance using bias/variance considerations enabling the researcher to determine if the model performance is limited by statistical bias or variance. We furthermore present the sensitivity map as a general method for extracting activation maps from statistical models within the probabilistic framework and illustrate relationships between mutual information and pattern reproducibility as derived in the NPAIRS framework described in a companion paper.
Collapse
Affiliation(s)
- U Kjems
- Department of Mathematical Modelling, Technical University of Denmark, DK-2800 Lyngby, Denmark.
| | | | | | | | | | | | | | | |
Collapse
|
12613
|
Billings SA, Lee KL. Nonlinear fisher discriminant analysis using a minimum squared error cost function and the orthogonal least squares algorithm. Neural Netw 2002; 15:263-70. [PMID: 12022513 DOI: 10.1016/s0893-6080(01)00142-3] [Citation(s) in RCA: 21] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/15/2022]
Abstract
The nonlinear discriminant function obtained using a minimum squared error cost function can be shown to be directly related to the nonlinear Fisher discriminant (NFD). With the squared error cost function, the orthogonal least squares (OLS) algorithm can be used to find a parsimonious description of the nonlinear discriminant function. Two simple classification techniques will be introduced and tested on a number of real and artificial data sets. The results show that the new classification technique can often perform favourably compared with other state of the art classification techniques.
Collapse
Affiliation(s)
- Steve A Billings
- Department of Automatic Control and Systems Engineering, University of Sheffield, UK.
| | | |
Collapse
|
12614
|
Loo K, Yip CL, Kao B, Cheung D. A lattice-based approach for I/O efficient association rule mining. INFORM SYST 2002. [DOI: 10.1016/s0306-4379(01)00046-1] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/29/2022]
|
12615
|
|
12616
|
|
12617
|
Prima S, Ourselin S, Ayache N. Computation of the mid-sagittal plane in 3-D brain images. IEEE TRANSACTIONS ON MEDICAL IMAGING 2002; 21:122-138. [PMID: 11929100 DOI: 10.1109/42.993131] [Citation(s) in RCA: 61] [Impact Index Per Article: 2.8] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/23/2023]
Abstract
We present a new method to automatically compute, reorient, and recenter the mid-sagittal plane in anatomical and functional three-dimensional (3-D) brain images. This iterative approach is composed of two steps. At first, given an initial guess of the mid-sagittal plane (generally, the central plane of the image grid), the computation of local similarity measures between the two sides of the head allows to identify homologous anatomical structures or functional areas, by way of a block matching procedure. The output is a set of point-to-point correspondences: the centers of homologous blocks. Subsequently, we define the mid-sagittal plane as the one best superposing the points on one side and their counterparts on the other side by reflective symmetry. Practically, the computation of the parameters characterizing the plane is performed by a least trimmed squares estimation. Then, the estimated plane is aligned with the center of the image grid, and the whole process is iterated until convergence. The robust estimation technique we use allows normal or abnormal asymmetrical structures or areas to be treated as outliers, and the plane to be mainly computed from the underlying gross symmetry of the brain. The algorithm is fast and accurate, even for strongly tilted heads, and even in presence of high acquisition noise and bias field, as shown on a large set of synthetic data. The algorithm has also been visually evaluated on a large set of real magnetic resonance (MR) images. We present a few results on isotropic as well as anisotropic anatomical (MR and computed tomography) and functional (single photon emission computed tomography and positron emission tomography) real images, for normal and pathological subjects.
Collapse
|
12618
|
|
12619
|
Wong KW, Leung CS, Chang SJ. Use of periodic and monotonic activation functions in multilayer feedforward neural networks trained by extended Kalman filter algorithm. ACTA ACUST UNITED AC 2002. [DOI: 10.1049/ip-vis:20020515] [Citation(s) in RCA: 13] [Impact Index Per Article: 0.6] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/20/2022]
|
12620
|
Mitra S, Pal S, Mitra P. Data mining in soft computing framework: a survey. ACTA ACUST UNITED AC 2002; 13:3-14. [DOI: 10.1109/72.977258] [Citation(s) in RCA: 371] [Impact Index Per Article: 16.9] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/07/2022]
|
12621
|
Rojo-Alvarez JL, Arenal-Maíz A, Artés-Rodríguez A. Discriminating between supraventricular and ventricular tachycardias from EGM onset analysis. IEEE ENGINEERING IN MEDICINE AND BIOLOGY MAGAZINE : THE QUARTERLY MAGAZINE OF THE ENGINEERING IN MEDICINE & BIOLOGY SOCIETY 2002; 21:16-26. [PMID: 11935984 DOI: 10.1109/51.993190] [Citation(s) in RCA: 27] [Impact Index Per Article: 1.2] [Reference Citation Analysis] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/06/2022]
|
12622
|
Mannila H. Local and Global Methods in Data Mining: Basic Techniques and Open Problems. AUTOMATA, LANGUAGES AND PROGRAMMING 2002. [DOI: 10.1007/3-540-45465-9_6] [Citation(s) in RCA: 35] [Impact Index Per Article: 1.6] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 12/12/2022]
|
12623
|
Dietterich TG. Machine Learning for Sequential Data: A Review. LECTURE NOTES IN COMPUTER SCIENCE 2002. [DOI: 10.1007/3-540-70659-3_2] [Citation(s) in RCA: 255] [Impact Index Per Article: 11.6] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 12/12/2022]
|
12624
|
|
12625
|
Tsuda K, Sugiyama M, Miller KR. Subspace information criterion for nonquadratic regularizers-Model selection for sparse regressors. ACTA ACUST UNITED AC 2002; 13:70-80. [DOI: 10.1109/72.977272] [Citation(s) in RCA: 6] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/09/2022]
Affiliation(s)
- K. Tsuda
- Fraunhofer FIRST, Berlin, Germany
| | | | | |
Collapse
|
12626
|
|
12627
|
Rojo-Alvarez JL, Arenal-Maíz A, Artés-Rodríguez A. Support vector black-box interpretation in ventricular arrhythmia discrimination. IEEE ENGINEERING IN MEDICINE AND BIOLOGY MAGAZINE : THE QUARTERLY MAGAZINE OF THE ENGINEERING IN MEDICINE & BIOLOGY SOCIETY 2002; 21:27-35. [PMID: 11935985 DOI: 10.1109/51.993191] [Citation(s) in RCA: 6] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/09/2022]
|
12628
|
Tang J, Chen Z, Fu AWC, Cheung DW. Enhancing Effectiveness of Outlier Detections for Low Density Patterns. ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING 2002. [DOI: 10.1007/3-540-47887-6_53] [Citation(s) in RCA: 238] [Impact Index Per Article: 10.8] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 12/05/2022]
|
12629
|
A Data-Clustering Algorithm on Distributed Memory Multiprocessors. LARGE-SCALE PARALLEL DATA MINING 2002. [DOI: 10.1007/3-540-46502-2_13] [Citation(s) in RCA: 94] [Impact Index Per Article: 4.3] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 12/12/2022]
|
12630
|
Byun H, Lee SW. Applications of Support Vector Machines for Pattern Recognition: A Survey. PATTERN RECOGNITION WITH SUPPORT VECTOR MACHINES 2002. [DOI: 10.1007/3-540-45665-1_17] [Citation(s) in RCA: 150] [Impact Index Per Article: 6.8] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 12/12/2022]
|
12631
|
Hawkins S, He H, Williams G, Baxter R. Outlier Detection Using Replicator Neural Networks. DATA WAREHOUSING AND KNOWLEDGE DISCOVERY 2002. [DOI: 10.1007/3-540-46145-0_17] [Citation(s) in RCA: 294] [Impact Index Per Article: 13.4] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 12/12/2022]
|
12632
|
Xusheng Wang, Chen J, Carr D, Bell B, Pickle L. Geographic statistics visualization: web-based linked micromap plots. Comput Sci Eng 2002. [DOI: 10.1109/5992.998645] [Citation(s) in RCA: 12] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/05/2022]
|
12633
|
Mielke HW, Wang G, Gonzales CR, Le B, Quach VN, Mielke PW. PAH and metal mixtures in New Orleans soils and sediments. THE SCIENCE OF THE TOTAL ENVIRONMENT 2001; 281:217-227. [PMID: 11778953 DOI: 10.1016/s0048-9697(01)00848-8] [Citation(s) in RCA: 37] [Impact Index Per Article: 1.6] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/23/2023]
Abstract
The purpose of this study is to determine the degree of PAH contamination and the association of PAHs with inorganic substances in soils and sediments of New Orleans. Bonnet Carré Spillway (BCS) (n = 5) provides modern baseline data, while urban soil samples (CTY) (n = 27) and sediment samples from Bayou St. John (BSJ) (n = 11) provide experimental data for New Orleans. Soil samples were collected from the top 2.5 cm of the surface, air-dried, and sieved (2 mm). Sediments samples were collected with a Wildco-Ekman bottom dredge, air-dried and finely ground. Accelerated solvent extraction (ASE) was used to release PAHs from the samples and analysis was conducted with gas chromatography-mass spectrometry (GC-MS). Metals were extracted using a 5:1 ratio of 1 mol/L nitric acid (room temperature) for soil and sediment samples, shaken for 2 h, centrifuged (1000 x g for 15 min) and filtered. Metal analysis was done by inductively coupled plasma-atomic emission spectrometry (ICP-AES). Mann-Whitney tests show PAH differences (P < 0.001). Ranking of total PAHs is, BSJ sediments (10.3 mg/kg) > CTY soils (3.7 mg/kg) > BCS alluvium (0.28 mg/kg). The sum of the metals are similar for BSJ sediments (698 mg/kg) and CTY soils (679 mg/kg) and significantly lower for BCS (189 mg/kg). Manganese of these samples is similar for each site. For paired samples, Pearson Product Moment Correlation tests reveal that many PAHs are strongly associated with each other at all locations. For BCS alluvium and BSJ sediments, total PAHs are not significantly associated with total metals. For CTY, most pairs of metals are significantly associated, and total soil PAHs are strongly associated with total soil metals (correlation 0.78, P = 4.9 x 10(-4)). The linear model, total soil PAH = 136.3 + 6.25 (total soil metals) forms the basis for a predicted PAH map of New Orleans. Previous empirical research demonstrates an association between soil lead and children's lead exposure. This study indicates that PAHs are part of the soil mixture of accumulated substances and by-products of industrial society that presents exposure potential in cities.
Collapse
Affiliation(s)
- H W Mielke
- Division of Basic Pharmaceutical Sciences, College of Pharmacy, Xavier University of Louisiana, New Orleans 70125, USA.
| | | | | | | | | | | |
Collapse
|
12634
|
Gupta A. A four‐faceted knowledge‐based approach to surmounting borders. JOURNAL OF KNOWLEDGE MANAGEMENT 2001. [DOI: 10.1108/eum0000000006531] [Citation(s) in RCA: 16] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/17/2022]
|
12635
|
|
12636
|
Thalhammer T, Schrefl M, Mohania M. Active data warehouses: complementing OLAP with analysis rules. DATA KNOWL ENG 2001. [DOI: 10.1016/s0169-023x(01)00042-8] [Citation(s) in RCA: 57] [Impact Index Per Article: 2.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/29/2022]
|
12637
|
|
12638
|
Abstract
Microarray technologies for measuring mRNA abundances in cells allow monitoring of gene expression levels for tens of thousands of genes in parallel. By measuring expression responses across hundreds of different conditions or timepoints a relatively detailed gene expression map starts to emerge. Using cluster analysis techniques, it is possible to identify genes that are consistently coexpressed under several different conditions or treatments. These sets of coexpressed genes can then be compared to existing knowledge about biochemical or signalling pathways, the function of unknown genes can be hypothesised by comparing them to other genes with characterised function, or from trends in expression profiles in general - why cell needs to transcribe or silence the genes during particular treatment. The regulation of genes on the DNA level is largely guided by particular sequence features, the transcription factor binding sites, and other signals encaptured in DNA. By analyzing the regulatory regions of the DNA of the genes consistently coexpressed, we can discover the potential signals hidden in DNA by computational analysis methods. The prerequisite for this kind of analysis is the existence of genomic DNA sequence, knowledge about gene locations, and experimental gene expression measurements for a variety of conditions. This article surveys some of the analysis methods and studies for such a computational discovery approach for yeast Saccharomyces cerevisiae.
Collapse
Affiliation(s)
- J Vilo
- European Bioinformatics Institute EBI, EMBL Outstation - Hinxton, Wellcome Trust Genome Campus, Cambridge CB10 1SD, UK.
| | | |
Collapse
|
12639
|
Burbidge R, Trotter M, Buxton B, Holden S. Drug design by machine learning: support vector machines for pharmaceutical data analysis. COMPUTERS & CHEMISTRY 2001; 26:5-14. [PMID: 11765851 DOI: 10.1016/s0097-8485(01)00094-8] [Citation(s) in RCA: 359] [Impact Index Per Article: 15.6] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/24/2022]
Abstract
We show that the support vector machine (SVM) classification algorithm, a recent development from the machine learning community, proves its potential for structure-activity relationship analysis. In a benchmark test, the SVM is compared to several machine learning techniques currently used in the field. The classification task involves predicting the inhibition of dihydrofolate reductase by pyrimidines, using data obtained from the UCI machine learning repository. Three artificial neural networks, a radial basis function network, and a C5.0 decision tree are all outperformed by the SVM. The SVM is significantly better than all of these, bar a manually capacity-controlled neural network, which takes considerably longer to train.
Collapse
Affiliation(s)
- R Burbidge
- University College London, Gower Street, London WCIE 6BT, UK
| | | | | | | |
Collapse
|
12640
|
|
12641
|
Abstract
Gene expression studies bridge the gap between DNA information and trait information by dissecting biochemical pathways into intermediate components between genotype and phenotype. These studies open new avenues for identifying complex disease genes and biomarkers for disease diagnosis and for assessing drug efficacy and toxicity. However, the majority of analytical methods applied to gene expression data are not efficient for biomarker identification and disease diagnosis. In this paper, we propose a general framework to incorporate feature (gene) selection into pattern recognition in the process to identify biomarkers. Using this framework, we develop three feature wrappers that search through the space of feature subsets using the classification error as measure of goodness for a particular feature subset being "wrapped around": linear discriminant analysis, logistic regression, and support vector machines. To effectively carry out this computationally intensive search process, we employ sequential forward search and sequential forward floating search algorithms. To evaluate the performance of feature selection for biomarker identification we have applied the proposed methods to three data sets. The preliminary results demonstrate that very high classification accuracy can be attained by identified composite classifiers with several biomarkers.
Collapse
Affiliation(s)
- M Xiong
- Human Genetics Center, University of Texas-Houston, Houston, TX 77225, USA.
| | | | | |
Collapse
|
12642
|
Novelli N, Cicchetti R. Functional and embedded dependency inference: a data mining point of view. INFORM SYST 2001. [DOI: 10.1016/s0306-4379(01)00032-1] [Citation(s) in RCA: 26] [Impact Index Per Article: 1.1] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/28/2022]
|
12643
|
|
12644
|
|
12645
|
Breiman L. Statistical Modeling: The Two Cultures (with comments and a rejoinder by the author). Stat Sci 2001. [DOI: 10.1214/ss/1009213726] [Citation(s) in RCA: 2289] [Impact Index Per Article: 99.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/19/2022]
|
12646
|
Feature subset selection by Bayesian networks: a comparison with genetic and sequential algorithms. Int J Approx Reason 2001. [DOI: 10.1016/s0888-613x(01)00038-x] [Citation(s) in RCA: 39] [Impact Index Per Article: 1.7] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/22/2022]
|
12647
|
Nong Ye, Xiangyang Li, Qiang Chen, Emran S, Mingming Xu. Probabilistic techniques for intrusion detection based on computer audit data. IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS - PART A: SYSTEMS AND HUMANS 2001; 31:266-274. [DOI: 10.1109/3468.935043] [Citation(s) in RCA: 17] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 09/01/2023]
|
12648
|
|
12649
|
Dhar V, Chou D. A comparison of nonlinear methods for predicting earnings surprises and returns. ACTA ACUST UNITED AC 2001; 12:907-21. [DOI: 10.1109/72.935099] [Citation(s) in RCA: 27] [Impact Index Per Article: 1.2] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/07/2022]
|
12650
|
Abstract
This paper describes the design of linked micromap plots for showing county estimates on a state by state basis. The linked micromap template was specifically developed to represent spatially indexed statistical summaries. Each plot shows regional names, spatial patterns and statistical patterns while linking them all together. Thus the design is useful for communicating summaries from a host of health and environmental studies. The specific design challenge in this paper is to create one-page plots for the states with 60 to 120 counties. While the county names and micromaps take up substantial space, the three examples demonstrate that there is sufficient space to represent two variables. The basic design has the potential for showing more. Consequently the new designs are suitable for presenting sophisticated summaries.
Collapse
Affiliation(s)
- D B Carr
- Center for Computational Statistics, MS-4A7, George Mason University, 4400 University Drive, Fairfax, VA 22030, USA.
| |
Collapse
|