Data processing: database and file management or data structures – Data integrity – Fragmentation – compaction and compression
Reexamination Certificate
2011-06-07
2011-06-07
Truong, Cam Y (Department: 2167)
Data processing: database and file management or data structures
Data integrity
Fragmentation, compaction and compression
Reexamination Certificate
active
07958096
ABSTRACT:
Systems and methods for performing data mining in a set of binary data arranged as a plurality of data items in which each data item has a plurality of bits, each bit in a corresponding one of a plurality of bit positions. The set of binary data is arranged in the data storage such that the binary data is in bit position groups. Each bit position group corresponds to a different one of the plurality of bit positions and includes bits of the binary data having that bit position. The binary data of each bit position group is compressed to produce data structures representing the set of binary data. A data mining technique is performed using the plurality of compressed data structures.
REFERENCES:
patent: 4794600 (1988-12-01), Lin
patent: 5715455 (1998-02-01), Macon, Jr. et al.
patent: 5724451 (1998-03-01), Shin et al.
patent: 5960437 (1999-09-01), Krawchuk et al.
patent: 5987468 (1999-11-01), Singh et al.
patent: 6115716 (2000-09-01), Tikkanen et al.
patent: 6122628 (2000-09-01), Castelli et al.
patent: 6134541 (2000-10-01), Castelli et al.
patent: 6185561 (2001-02-01), Balaban et al.
patent: 6707948 (2004-03-01), Cosman et al.
patent: 6728728 (2004-04-01), Spiegler et al.
patent: 6941303 (2005-09-01), Perrizo
patent: 6941318 (2005-09-01), Tamayo et al.
patent: 2001/0042186 (2001-11-01), Iivonen et al.
patent: 2003/0208488 (2003-11-01), Perrizo
Khan et. al. “K-Nearest Neighbor Classification on Spatial Data Streams”. http:wwww.cs.ndsu.nodak.edu/—datasurg/. Final Paper in Word. Jun. 28, 2001. (Annotated pp. 1-23).
“Growing Decision Trees on Support-Less Association Rules,” K. Wang S. Zhou, Y. He, 6thACM SIGKDD International Conference on Knowledge Discovery & Data Mining, Boston, Massachusetts, 5 pgs., Aug. 2000.
“An Interval Classifier for Database Mining Applications,” R. Agrawal, S. Ghosh, T. Imielinski, B. Iyer, A. Swami, 18th International Conference on Very Large Data Bases, Vancouver, Canada, 14 pgs., Aug. 1992.
“SPRINT: A Scalable Parallel Classifier for Data Mining,” J. Shafer, R. Agrawal, M. Mehta, 22nd International Conference on Very Large Data Bases, Bombay, India, pp. 544-555, Sep. 1996.
“Fast Approach for Association Rule Mining for Remotely Sensed Imagery,” Q. Zhou, Q. Ding, W. Perrizo, Proceedings of the ISCA International Conference on Computers and Their Applications, New Orleans, Louisiana, 4 pgs., Mar. 2000.
“Efficient and Effective Clustering Method for Spatial Data Mining,” R. Ng, J. Han, Proceedings of the 20th International Conference on Very Large Data Bases, Santiago, Chile, 12 pgs., Sep. 1994.
“Data Mining: An Overview from a Database Perspective,” M.S. Chen, J Han, P.S. Yu,IEEE Transactions on Knowledge and Data Engineering, vol. 8, No. 6, pp. 1-40, Dec. 1996.
“Mining Association Rules Between Sets of Items in Large Database,” R. Agrawal, T. Imielinski, A. Swami, ACM-SIGMOD 93, Washington, D.C., pp. 207-216, May 1993.
“Quad Trees: A Data Structure for Retrieval of Composite Keys,” R.A. Finkel, J.L. Bentley, Acta Informatica, vol. 4, pp. 1-9, 1974.
“Mining Frequent Patterns Without Candidate Generation,” J. Han, J. Pei, Y. Yin, ACM-SIGMOD 2000, Dallas, Texas, pp. 1-12, May 2000.
“The Application of Association Rule Mining on Remotely Sensed Data,” J. Dong, W. Perrizo, Q. Ding, J. Zhou, Proceedings of ACM Symposium on Applied Computers, Italy, 6 pgs., Mar. 2000.
“Finding Interesting Associations Without Support Pruning,” E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J. Ullman, C. Yang, Proceedings of 26th International Conference on Very Large Data Bases, Cairo, Egypt, 12 pgs., Sep. 2000.
“Integrating Classification and Association Rule Mining,” B. Liu, W. Hsu, Y. Ma, The Fourth International Conference on Knowledge Discovery and Data Mining, New York, New York, 7 pgs., Aug. 1998.
“Inferring Decision Trees Using the Minimum Description Length Principle,” J.R. Quinlan, R.L. Rivest, Information and Computation, Academic Press, Inc., vol. 80, pp. 227-248, 1989.
“Automatic Subspace Clustering of High Dimensional Data for Data Mining Application,” R. Agrawal, J Cehrke, D. Gunopulos, P. Raghavan,Proceedings of ACM SIGMOD International Conference on Management of Data, Seattle, Washington, 12 pgs., Jun. 1998.
“Constraint-Based Clustering in Large Databases,” A.K.H. Tung, J. Han, L. V.S. Lakshmanan, R.T. Ng,The 8th International Conference on Database Theory, London, United Kingdom, 15 pgs., Jan. 2001.
“Fast Vertical Mining Using Diffsets,” Mohammed J. Zaki, Karam Gouda, Special Interest Group in Knowledge discovery and Data Mining (SIGKDD), Washington DC, 21 pgs, Aug. 2003.
“Request Order Linked List(ROLL):A Concurrency Control Object for Centralized and Distributed Database Systems,” William Perrizo, Proceedings of IEEE International Conference on Data Engineering, Kobe, Japan, pp. 278-285, Apr. 11, 1991.
“K-Nearest Neighbor Classification on Spatial Data Streams Using P-Trees”, Maleq Khan, Qin Ding, William Perrizo, 6thPacific-Asia Konwledge Discovery and Data-mining Conference PAKDD, Taipei, Taiwan, pp. 517-528, May, 2002.
“Brute-Force Mining of High-Confidence Classification Rules”, Roberto J. Bayardo Jr., Proc. of the Third Int'l Conf. on Knowledge Discovery & Data Mining, pp. 123-126, 1997.
Web site print-out: “Augmenting Data Structures”, Note Taker: Srivani Adathakula, Sep. 9, 1998.
File wrapper for U.S. Appl. No. 09/957,637, filed Sep. 20, 2001.
File wrapper for U.S. Appl. No. 10/367,644, filed Feb. 14, 2003.
File wrapper for U.S. Appl. No. 11/791,004, filed Aug. 28, 2007.
International Search Report and Written Opinion for PCT/US05/42101 dated Aug. 30, 2006.
“Fast Algorithms for Mining Association Rules,” R. Agrawal, R. Srikant, Proceedings of the International Conference on VLDB, Santiago, Chile, 13 pgs., Sep. 1994.
“Mining Quantitative Association Rules in Large Relational Tables,” R. Srikant, R. Agrawal, ACM-SIGMOD 96, Montreal, Canada, pp. 1-12, Jun. 1996.
“An Effective Hash-Based Algorithm for Mining Association Rules,” J.S. Park, M.S. Chen, P.S. Yu, ACM-SIGMOD 95, California, pp. 175-186, 1995.
“Multidimensional Access Methods,” V. Gaede, O. Gunther, ACM Computing Surveys, vol. 30, No. 2, pp. 171-231, Jun. 1998.
“The Quadtree and Related Hierarchical Data Structure,” H. Samet, ACM Computing Survey, vol. 16, No. 2, pp. 188-260, Jun. 1984.
Web site print-out: “What are HH-codes and how can they be used to store hydrographic data?,” H. Iverson, Norwegian Hyrdorgraphic Service (NHS), http://www.statkart.no
1hdb/iveher/hhtext.htm, 7 pgs., Jan. 1998.
“Run-Length Encodings,” S.W. Golomb, IEEE Trans. on Information Theory, vol. 12, No. 3, pp. 399-401, Jul. 1966.
“Spatial Data Mining: a Database Approach,” M. Ester, H-P. Kriegel, J. Sander, Proceedings of the Fifth International Symposium on Large Spatial Databases (SSD), Berlin, Germany, 20 pgs., 1997.
“Spatial Data Mining: Progress and Challenges Survey Paper,” K. Koperski, J. Adhikary, J. Han, Data Mining and Knowledge Discovery, 16 pgs., 1996.
“Spatial Data Mining: Database Primitives, Algorithms and Efficient DBMS Support,” M. Ester, A. Frommelt, H-P. Kriegel, J. Sander, Data Mining and Knowledge Discovery, 28 pgs., 1999.
“Discovery of Spatial Association Rules in Geographic Information Databases,” K. Koperski, J. Han, SSD, 20 pgs. 1995.
Website print-out:SMILEY(Signature Miner&Interface Language for Earth Yield), Database Systems Users & Research Group at NDSU (DataSURG) http://www.midas.cs.ndsu.nodak.edu/˜smiley, 5 pgs., 2002.
“Parameter Optimized, Vertical, Nearest-Neighbor-Vote and Boundary-Based Classification,” William Perrizo, Amal Perera, 7 pgs., Dec. 2006.
“Turbo charging Ver
NDSU--Research Foundation
Patterson Thuente Christensen Pedersen , P.A.
Pham Michael
Truong Cam Y
LandOfFree
System and method for organizing, compressing and... 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 organizing, compressing and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for organizing, compressing and... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2739732