Graphics Reference
In-Depth Information
mumspanning trees, andother graphs forcharacterizing high-dimensional data. But
asTukeysaidmanytimes,morepowerfulcomputing environments wouldbeneeded
to realize the power of these methods. hat time has arrived.
References
Altschul, S., Bundschuh, R., Olsen, R. and Hwa, T. (
). he estimation of statis-
tical parameteers for local alignment score distributions., Nucleic Acids Research
:
-
.
Battista, G.D., Eades, P., Tamassia, R. and Tollis, I. (
). Algorithms for drawing
graphs: an annotated bibliography, Computational Geometry: heory and Applica-
tions
:
-
.
Battista, G.D.,Eades, P.,Tamassia, T.and Tollis, I.(
).Graph Drawing: Algorithms
for the Visualization of Graphs, Prentice-Hall,. Upper Saddle River, NJ.
Bederson, B., Shneiderman, B. and Wattenberg, M. (
). Ordered and quantum
treemaps: Making effective use of
d space to display hierarchies, ACM Transac-
tionsonGraphics(TOG)
(
):
-
.
Box, G. E.P. and Jenkins, G.M. (
). Time Series Analysis: Forecasting and Control
(rev. ed.), Holden-Day, Oakland, CA.
Breiman, L., Friedman, J., Olshen, R. and Stone, C. (
). Classification and Regres-
sion Trees,Wadsworth,Belmont,CA.
Brin, S. and Page, L. (
). he anatomy of a large-scale hypertextual Web search
engine, Computer Networks and ISDN Systems
(
-
):
-
.
Carr,D.B.,Littlefield, R.J.,Nicholson, W.L.and Littlefield, J.S. (
).Scatterplot ma-
trix techniques for large n, Journal of the American Statistical Association
:
-
.
Dirschedl, P. (
). Klassifikationsbaumgrundlagen und -neuerungen, in W. Flis-
cher, M. Nagel and R. Ostermann (eds), Interaktive Datenalyse mit ISP,Essen,
pp.
-
.
Gandhi,A.(
).Content-based image retrieval: plant species identification,PhD
thesis, Oregon State University.
Hartigan, J.A. (
). Printer graphics for clustering, Journal of Statistical Computa-
tion and Simulation
:
-
.
Hopcrot, J.E. and Wong, J.K. (
). Linear time algorithm for isomorphism of pla-
nar graphs, STOC: ACM Symposium on heory of Computing (STOC).
Johnson, B. and Shneiderman, B. (
). Treemaps: A space-filling approach to the
visualization of hierarchical information structures, Proceedings of the IEEE Infor-
mation Visualization '
, pp.
-
.
Klein, P., Sebastian, T. and Kimia, B. (
). Shape matching using edit-distance: an
implementation, Twelth Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA),Washington,D.C.,pp.
-
.
Kleiner, B. and Hartigan, J. (
). Representing points in many dimensions by trees
and castles, Journal of the American Statistical Association
:
-
.
Kobsa, A. (
). User experiments with tree visualization systems, Proceedings of
the IEEE Information Visualization
,pp.
-
.
