Automatic subspace clustering of high dimensional data for data

Data processing: database and file management or data structures – Database design – Data structure types

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

707 1, 707 6, G06F 1730

Patent

active

060030291

ABSTRACT:
A method for finding clusters of units in high-dimensional data having the steps of determining dense units in selected subspaces within a data space of the high-dimensional data, determining each cluster of dense units that are connected to other dense units in the selected subspaces within the data space, determining maximal regions covering each cluster of connected dense units, determining a minimal cover for each cluster of connected dense units, and identifying the minimal cover for each cluster of connected dense units.

REFERENCES:
patent: 4956774 (1990-09-01), Shibamiya et al.
patent: 5031206 (1991-07-01), Riskin
patent: 5168565 (1992-12-01), Morita
patent: 5418951 (1995-05-01), Damashek
patent: 5446908 (1995-08-01), Kevorkian
patent: 5655137 (1997-08-01), Kevorkian
patent: 5669006 (1997-09-01), Joskowicz et al.
patent: 5742283 (1998-04-01), Kim
patent: 5784540 (1998-07-01), Faltings
R. Agrawal et al., Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications, Paper AR.sub.-- 297, pp. 1-18, 1997.
R. Agrawal et al., Modeling Multidemsional Databases, Procedings of the 13th International Conference on Data Engineering, pp. 232-234, Birmingham, England, Apr., 1997.
P.J. Rousseeuw et al., Robust Regression and Outlier Detection, John Wiley & Sons, pp. 216-229, 1987.
A. Arning et al., A Linear Method for Deviation Detection in Large Databases, Proceedings of the 2nd International Conference on Knowledge Discovery in Databases and Data Mining, pp. 164-169, Portland, Oregon, Aug., 1996.
C.J. Matheus et al., Selecting and Reporting What is Interesting, Advances in Knowledge Discovery and Data Mining, pp. 495-515, AAAI Press, 1996.
W. Klosgen, Efficient Discovery of Interesting Statements in Databases, Journal of Intelligent Information Systems (JIIS), vol. 4, No. 1, pp. 53-69, Jan. 1995.
D.C. Montgomery, Design and Anaylsis of Experiments, Third Edition, John Wiley & Sons, pp. 196-215, and pp. 438-455, 1991.
S. Agarwal et al., On the Computation of Multidimensional Aggregates, Proceedings of the 22nd VLDB Conference Mumbai (Bombay), India, 1996, pp. 1-16.
R. Agrawal et al., An Interval Classifier for Database Mining Applications, Proceedings of the 18th VLDB Conference, Vancouver, British Columbia, Canada, 1992, pp. 1-14.
R. Agrawal et al. Database Mining: A Performance Perspective, IEEE Transactions on Knowledge and Data Engineering, vol. 5, No. 6, Dec. 1993, pp. 914-925.
L.G. Valiant, A Theory of the Learnable, Communications of the ACM, vol. 27, pp. 1134-1142, 1984.
D.E. Rumelhart et al., Feature Discovery by Competitive Learning, originally published in Cognitive Science, 9:1, 1965, pp. 306-325.
R.S. Michalski et al. Learning from Observation: Conceptual Clustering, Machine Learning: An Artificial Approach, vol. I, R.S. Michalski et al. (Editors), Morgan-Kaufman, pp. 331-363, 1983.
S. Jose, Conceptual Clustering, Categorization, and Polymorphy; Machine Learning 3: 343-372; Copyright 1989 Kluwer Academic Publishers.
D.H. Fisher, Knowledge Acquisition Via Incremental Conceptual Clustering; pp. 267-283; Originally published in Machine Learning, copyright 1987 Kluwer Academic Publishers, Boston.
D.W. Aha et al., Instance-Based Learning Algorithms; Machine Learning, 6, 37-66 copyright 1991 Kluwer Academic Publishers, Boston.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Automatic subspace clustering of high dimensional data for data does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Automatic subspace clustering of high dimensional data for data , we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Automatic subspace clustering of high dimensional data for data will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-873603

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.