Data processing: database and file management or data structures – Database design – Data structure types
Patent
1997-06-13
1999-03-16
Black, Thomas G.
Data processing: database and file management or data structures
Database design
Data structure types
707 1, 707 5, G06F 1730
Patent
active
058843051
ABSTRACT:
A system and method are provided for performing the process known as "data mining" on a database of raw data records having common data elements, to obtain categorical cluster rules as to what elements of the data tend to occur in common in multiple records. Initial values are assigned to the elements. In an iterative process, the associated value for each given one of the elements is recalculated based on the values of other elements which occur in records together with the given element. Thus, the associated values will tend to grow for elements occurring together in multiple records. Those common occurrences of elements in multiple records represent categorical cluster rules the owner of the data is likely to want to know about. Thus, these rules may be identified based on the growth of the associated values for the records.
REFERENCES:
patent: 5257185 (1993-10-01), Farley et al.
patent: 5446891 (1995-08-01), Kaplan et al.
patent: 5615341 (1997-03-01), Agrawal et al.
H. C. Arents et al., "Concept-based Retrieval of Hypermedia Information: From Term Indexing to Semantic Hyperindexing", Information Processing & Management, vol. 29, No. 3, 1993, pp. 373-386.
R. Agrawal et al., "Mining Association Rules Between Sets of Items in Large Databases", Proceedings of ACM-SIGMOD, Washington, DC, May 1993, pp. 207-216.
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.
R. Agrawal et al., "Fast Algorithms for Mining Association Rules", Proceedings of the 20th International Conference on Very Large Data Bases, Santiago, Chile, 1994, pp. 487-499.
R. Agrawal et al., "Mining Sequential Patterns", IEEE, 1995, pp. 3-14.
R. Agrawal et al., "Querying Shapes of Histories", Proceedings of the 21st International Conference on Very Large Data Bases , Zurich, Switzerland, 1995.
N. Beckmann et al., "The R*-tree: An Efficient and Robust Access Method for Points and Rectangles.sup.+ ", Communications of the ACM, 1990, pp. 322-331.
J. Bichteler et al., "Document Retrieval by Means of an Automatic Classification Algorithm for Citations", Information Storage Retrieval, vol. 10, 1974, pp. 267-278.
M. E. Frisse, "Searching for Information in a Hypertext Medical Handbook", Communications of the ACM, vol. 31, No. 7, Jul. 1988, pp. 880-886.
G. H. Golub et al., "Matrix Computations: Orthogonalization and Least Squares", The Johns Hopkins University Press, 1989, pp. 218-219, 351-354.
J. Han et al., "Discovery of Multiple-level Association Rules from Large Databases", Proceedings of the 21st International Conference on Very Large Data Bases, Zurich Switzerland, 1995, pp. 420-431.
M. Houtsma et al, "Set-oriented Mining for Association Rules", IBM Research Report, RJ9567, Oct. 22, 1993.
T. R. Kochtanek, "Brief Communication: Document Clustering, Using Macro Retrieval Techniques", Journal of the American Society for Information Science, vol. 34, No. 5, 1983, pp. 356-359.
F. Narin et al., "Bibliometrics", Chapter 2, Annual Review of Information Science and Technology, 1977, pp. 35-58.
R. T. Ng et al., "Efficient and Effective Clustering Methods for Spatial Data Mining", Proceedings of the 20th International Conference on Very Large Data Bases, Santiago, Chile, 1994, pp. 144-155.
J. S. Park et al., "An Effective Hash-based Algorithm for Mining Association Rules", SIGMOD, San Jose, California, 1995, pp. 175-186.
G. Platetsky-Shapiro, "Discovery, Analysis, and Presentation of Strong Rules", Chapter 13, GTE Laboratories Incorporated, pp. 229-248, no date.
R. Rada et al., "Retrieval Hierarchies in Hypertext", Information Processing & Management, vol. 29, No. 3, 1993, pp. 359-371.
E. Rivlin et al., "Navigating in Hyperspace: Designing a Structure-based Toolbox", Communications of the ACM, vol. 37, No. 2, Feb. 1994, pp. 87-96.
A. Savasere et al., "An Efficient Algorithm for Mining Association Rules in Large Databases", Proceedings of the 21st International Conference on Very Large Data Bases, Zurich, Switzerland, 1995, pp. 432-444.
W. M. Shaw, Jr., "Subject Indexing and Citation Indexing--Part II: an Evaluation and Comparison", Information Processing & Management, vol. 26, No. 6, 1990, pp. 705-718.
W. M. Shaw, Jr., "Subject and Citation Indexing--Part I: The Clustering Structure of Composite Representations in the Cystic Fibrosis Document Collection", Journal of the American Society for Information Science, vol. 42, No. 9, 1991, pp. 669-675.
W. M. Shaw, Jr., "Subject and Citation Indexing--Part II: The Optimal, Cluster-based Retrieval Performance of Composite Representations", Journal of the American Society for Information Science, vol. 42, No. 9, 1991, pp. 676-684.
R. W. Schwanke et al., "Cross References are Features", Machine Learning: From Theory to Applications, Springer-Verlag, pp. 107-123, no date.
D. A. Spielman et al., "Spectral Partitioning Works: Planar Graphs and Finite Element Meshes", Based on UC Berkeley Technical Report UCB//CSD-96-898, no date.
R. Srikant et al., "Mining Generalized Association Rules", Proceedings of the 21st International Conference on Very Large Data Bases, Zurich, Switzerland, 1995, pp. 407-419.
R. Weiss et al., "HyPursuit: A Hierarchial Network Search Engine that Exploits Content-link Hypertext Clustering", MIT Laboratory for Computer Science, no date.
Kleinberg Jon Michael
Raghavan Prabhakar
Black Thomas G.
Coby Frantz
International Business Machines - Corporation
Pintner James C.
Tran Khanh Q.
LandOfFree
System and method for data mining from relational data by sievin does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for data mining from relational data by sievin, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for data mining from relational data by sievin will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-827640