Work Files Saved Searches
   My Account                                                  Search:   Quick/Number   Boolean   Advanced   Derwent    Help   


 The Delphion Integrated View

  Buy Now:   Buy PDF- 26pp  PDF  |   File History  |   Other choices   
  Tools:  Citation Link  |  Add to Work File:    
  View:  Expand Details   |  INPADOC   |  Jump to: 
  Go to:  Derwent  
 Email this to a friend  Email this to a friend 
       
Title: US6100901: Method and apparatus for cluster exploration and visualization
[ Derwent Title ]


Country: US United States of America

View Images High
Resolution

 Low
 Resolution

 
26 pages

 
Inventor: Mohda, Dharmendra Shantilal; San Jose, CA
Martin, David Charles; San Jose, CA
Spangler, William Scott; San Martin, CA
Vaithyanathan, Shivakumar; San Jose, CA

Assignee: International Business Machines Corporation, Armonk, NY
other patents from INTERNATIONAL BUSINESS MACHINES CORPORATION (280070) (approx. 44,393)
 News, Profiles, Stocks and More about this company

Published / Filed: 2000-08-08 / 1998-06-22

Application Number: US1998000102087

IPC Code: Advanced: G06T 5/00;
Core: more...
IPC-7: G06T 11/20;

ECLA Code: G06K9/62B5; G06K9/62B4; G06T7/00S1; G06T7/60M;

U.S. Class: Current: 345/440;
Original: 345/440;

Field of Search: 345/440,427 707/006

Priority Number:
1998-06-22  US1998000102087

Abstract:     A method and apparatus for visualizing a multi-dimensional data set in which the multi-dimensional data set is clustered into k clusters, with each cluster having a centroid. Then, either two distinct current centroids or three distinct non-collinear current centroids are selected. A current 2-dimensional cluster projection is generated based on the selected current centroids. In the case when two distinct current centroids are selected, two distinct target centroids are selected, with at least one of the two target centroids being different from the two current centroids. In the case when three distinct current centroids are selected, three distinct non-collinear target centroids are selected, with at least one of the three target centroids being different from the three current centroids. An intermediate 2-dimensional cluster projection is generated based on a set of interpolated centroids, with each interpolated centroid corresponding to a current centroid and to a target centroid associated with the current centroid. Each interpolated centroid is interpolated between the corresponding current centroid and the target centroid associated with the current centroid. Alternatively, the intermediate 2-dimensional cluster projection is generated based on an interpolated 2-dimensional nonlinear cluster projection that is based on the selected current centroids and the selected target centroids.

Attorney, Agent or Firm: Tran, Khank Q.Banner & Witcoff, Ltd. ;

Primary / Asst. Examiners: Powell, Mark R.; Good-Johnson, Motilewa

Maintenance Status: CC Certificate of Correction issued

INPADOC Legal Status: Show legal status actions

Family: None

First Claim:
Show all 40 claims
What is claimed is:     1. A method for visualizing a multi-dimensional data set, the method comprising the steps of:
  • clustering the multi-dimensional data set into k clusters, each cluster having a centroid;
  • selecting one of two distinct current centroids and three distinct non-collinear current centroids;
  • generating a current 2-dimensional cluster projection based on the selected current centroids;
  • selecting two distinct target centroids when two distinct current centroids are selected, at least one of the two target centroids being different from the two current centroids;
  • selecting three distinct non-collinear target centroids when three distinct non-collinear current centroids are selected, at least one of the three target centroids being different from the three current centroids; and
  • generating an intermediate 2-dimensional cluster projection based on the current centroids and the target centroids.


Background / Summary: Show background / summary

Drawing Descriptions: Show drawing descriptions

Description: Show description

Forward References: Show 38 U.S. patent(s) that reference this one

       
U.S. References: Go to Result Set: All U.S. references   |  Forward references (38)   |   Backward references (4)   |   Citation Link

Buy
PDF
Patent  Pub.Date  Inventor Assignee   Title
Buy PDF- 20pp US5450535  1995-09 North  AT&T Corp. Graphs employing clusters
Buy PDF- 17pp US5625767  1997-04 Bartell et al.   Method and system for two-dimensional visualization of an information taxonomy and of text documents based on topical content of the documents
Buy PDF- 42pp US5832182  1998-11 Zhang et al.  Wisconsin Alumni Research Foundation Method and system for data clustering for very large databases
Buy PDF- 12pp US5983224  1999-11 Singh et al.  Hitachi America, Ltd. Method and apparatus for reducing the computational requirements of K-means data clustering
       
Foreign References: None

Other References:
  • Lee et al., "Modified K-means Algorithm for Vector Quantizer Design", IEEE Signal Processing Letters, vol. 4, No. 1, pp. 2-4, Jan. 1997. (3 pages) Cited by 10 patents [ISI abstract]
  • Su et al, "Application of Neural Networks in Cluster Analysis", IEEE, pp. 1-5, Jan. 1997.
  • D. Keim, Enhancing the Visual Clustering of Query-Dependent Database Visualization Techniques Using Screen-Filling Curves, Institute for Computer Science, University of Munich, Leopoldstr. 11B, D-80802, Munich, Germany.
  • G. Grinstein et al., Visualizing Multidimensional (Multivariate) Data and Relations, Proceedings of the IEEE Conference on Visualization 1994, Washington, D.C., pp. 404-411.
  • M. Ester et al., Spatial Data Mining: A Database Approach, Advances in Spatial Databases, M. Scholl et al. Editors, 5th International Symposium, SSD'97 Berlin, Germany, Jul. 15-18, 1997 Proceedings, pp. 46-66.
  • D.P. Huttenlocher et al., Comparing Point Sets Under Projection, Proceedings of the Fifth Annual ACM-SIAM Symposium On Discrete Algorithms, Arlington, Virginia, Jan. 23-25, 1994; pp. 1-7.
  • S.Z. Selim et al., K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. PAMI-6, No. 1, Jan. 1984, pp. 81-87. (7 pages) Cited by 5 patents
  • J. H. Friedman et al., A Projection Pursuit Algorithm for Exploratory Data Analysis, IEEE Transactions On Computers, vol. c-23, No. 9, Sep. 1974, pp. 881-810. (10 pages) Cited by 15 patents
  • H. Ralambondrainy, A Conceptual Version of the K-Means Algorithm. Pattern Recognition Letters 16 (1995) pp. 1147-1157. (11 pages) Cited by 5 patents [ISI abstract]
  • S. Vaithyanathan et al., A Multiple PCA (MPCA) Model for Hierarchical Decomposition Of Large Document Collections, IBM Research Report, RJ 10082 (91898) Jul. 25, 1997, Computer Science, pp. 1-13.
  • D. Swayne et al., Exploratory Data Analysis Using Interactive Dynamic Graphics, Third International Conference on Knowledge Discovery & Data Mining, Newport Beach, California, Aug. 14, 1997, pp. T4-1, T4-4-T4-32.
  • A. Buja et al., Theory and Computational Methods for Dynamic Projections in High-Dimensional Data Visualization, Journal of Computational and Graphical Statistics, 1997, pp. 1-67.
  • G.T. Toussaint, The Relative Neighbourhood Graph Of A Finite Planar Set, Pattern Recognition, vol. 12, pp. 261-268, received Sept. 21 1979.
  • M. Ichino, The Relative Neighborhood Graph For Mixed Feature Variables, Pattern Recognition, vol. 18, No. 2, pp. 161-167, 1985. (7 pages) Cited by 2 patents
  • G.W. Furnas et al., Prosection Views: Dimensional Inference Through Sections and Projections, Journal of Computational and Graphical Statistics, pp. 1-26, Dec. 1, 1993.
  • A. Buja et al., Grand Tour Methods: An Outline, Elsevier Science Publishers B.V. (North-Holland), pp. 63-67, 1986.
  • D. Pollard, A Central Limit Theorem for k-Means Clustering, The Annals of Probability, vol. 10, No. 4, 919-926, 1982. (8 pages) Cited by 2 patents
  • D. Pollard, Quantization and the Method of k-Means, IEEE Transactions on Information Theory, vol. IT-28, No. 2, pp. 199-205, Mar. 1982. (7 pages) Cited by 2 patents
  • C. Hurley et al., Analyzing High-Dimensional Data With Motion Graphics, SIAM Journal of Science Stat. Computer, vol. 11, No. 6, pp. 1193-1211, Nov 1990. (19 pages)
  • D. Asimov, The Grand Tour: A Tool For viewing Multidimensional Data, SIAM Journal of Science Stat. Computer, vol. 6, No.1, pp. 128-143, Jan. 1985. (16 pages)
  • Duda et al., Unsupervised Learning And Clustering, Pattern classification and Scene Analysis, New York, Wiley, pp. 210-257, 1973.
  • B. Ripley, Pattern Recognition and Netural Networks, Cambridge University Press, pp. 311-322, 1996.


  • Inquire Regarding Licensing

    Powered by Verity


    Plaques from Patent Awards      Gallery of Obscure PatentsNominate this for the Gallery...

    Thomson Reuters Copyright © 1997-2010 Thomson Reuters 
    Subscriptions  |  Web Seminars  |  Privacy  |  Terms & Conditions  |  Site Map  |  Contact Us  |  Help