Method and system for subspace bounded recursive clustering...

Details Method and system for subspace bounded recursive clustering... Method and system for subspace bounded recursive clustering...

2006-07-12

2011-11-08

Gaffin, Jeffrey A (Department: 2129)

Data processing: artificial intelligence

Knowledge processing system

C706S046000, C706S047000

Reexamination Certificate

active

08055597

ABSTRACT:
A computerized method of representing a dataset includes obtaining a dataset, the dataset defining an attribute space; decomposing the attribute space into a plurality of attribute subspaces; generating a parent taxonomy of the obtained dataset with respect to one of the plurality of attribute subspaces, the parent taxonomy organizing the obtained dataset into a plurality of data subsets; generating a child taxonomy with respect to another one of the plurality of attribute subspaces, the child taxonomy organizing each of the plurality of data subsets within the parent taxonomy into at least one data subset; iteratively repeating generating the child taxonomy until a predetermined termination condition is satisfied, wherein the child taxonomy of a preceding iteration is the parent taxonomy of the current iteration; and assigning category labels to the data subsets.

REFERENCES:
patent: 6446061 (2002-09-01), Doerre et al.
patent: 6460036 (2002-10-01), Herz
patent: 6592627 (2003-07-01), Agrawal et al.
patent: 6886007 (2005-04-01), Leymann et al.
patent: 2002/0042793 (2002-04-01), Choi
patent: 2003/0126561 (2003-07-01), Woehler et al.
patent: 2003/0177000 (2003-09-01), Mao et al.
patent: 2003/0217052 (2003-11-01), Rubenczyk et al.
patent: 2004/0044539 (2004-03-01), Taricco et al.
patent: 2005/0044487 (2005-02-01), Bellegarda et al.
patent: 2006/0004747 (2006-01-01), Weare
patent: 2006/0031217 (2006-02-01), Smith et al.
patent: 2006/0095521 (2006-05-01), Patinkin
Wiesman et al., F., “Automatic Ontology Mapping for Agent Communication”, AAMAS '02, pp. 563-564, Jul. 15-19, 2002.
Ding et al., Y., “Ontology Research and Development Part 1—A Review of Ontology Generation”, Journal of Information Science, pp. 1-23, 2002.
Uschold et al., “Ontology Reuse and Application”, FOIS '98, pp. 1-15, 1998.
U.S. Appl. No. 11/436,142, filed May 16, 2006, Acharya et al.
U.S. Appl. No. 11/457,090, filed Jul. 12, 2006, Acharya et al.
U.S. Appl. No. 11/457,095, filed Jul. 12, 2006, Acharya et al.
U.S. Appl. No. 11/457,103, filed Jul. 12, 2006, Acharya et al.
U.S. Appl. No. 11/457,107, filed Jul. 12, 2006, Acharya et al.
U.S. Appl. No. 11/457,115, filed Jul. 12, 2006, Acharya et al.
Non Final Office Action for U.S. Appl. No. 11/457,115 mailed Feb. 12, 2009.
Non Final Office Action from U.S. Appl. No. 11/457,090 mailed Feb. 10, 2009.
Non Final Office Action from U.S. Appl. No. 11/457,095 mailed Feb. 9, 2009.
Non Final Office Action from U.S. Appl. No. 11/457,103 mailed Feb. 9, 2009.
Non Final Office Action from U.S. Appl. No. 11/457,107 mailed Feb. 9, 2009.
Conrad, Jack G. et al., “Effective Document Clustering for Large Heterogeneous Law Firm Collections”, pp. 177-187, Jan. 2005.
De Queiroz, Kevin et al., “Phylogeny as a Central Principle in Taxonomy: Phylogenetic Definition of Taxon Names”, pp. 1-17, Dec. 2002.
Dhar, Vassant et al., “Discovering Interesting Patterns for Investment Decision Making with GLOWER—A Genetic Learner Overlaid with Entropy Reduction”, pp. 1-30, Jan. 2000.
Examiner Interview Summary from U.S. Appl. No. 11/457,095 mailed Aug. 13, 2009.
Final Office Action for U.S. Appl. No. 11/457,090 mailed Aug. 19, 2009.
Final Office Action from U.S. Appl. No. 11/457,103 mailed Aug. 19, 2009.
Notice of Allowance for U.S. Appl. No. 11/457,095 mailed Aug. 13, 2009.
Notice of Allowance from U.S. Appl. No. 11/457,107 mailed Jul. 23, 2009.
Notice of Allowance from U.S. Appl. No. 11/457,115 mailed Aug. 25, 2009.
Lee, John W. et al., “Hierarchical Clustering Based on Ordinal Consistency”, Department of Computing, Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong. Received Sep. 2, 2004, accepted May 16, 2005.Pattern Recognition 38(2005) 1913-1925.
Lee, John W. , “Order Invariant Hierarchical Clustering”, Department of Computing, Hong Kong Polytechnic University, Department of Rehabilitation Sciences, Hong Kong Polytechnic University, Hung Hom, Hong Kong, China, 2002IEEE, 6 pgs.
USPTO, Examiner Interview Summary from U.S. Appl. No. 11/457,090 mailed Mar. 12, 2010.
USPTO, Examiner Interview Summary from U.S. Appl. No. 11/457,090 mailed Jul. 26, 2010.
USPTO, Non-Final Office Action from U.S. Appl. No. 11/457,090 mailed Dec. 22, 2009.
USPTO, Non-Final Office Action from U.S. Appl. No. 12/620,499 mailed Jul. 22, 2010.
USPTO, Notice of Allowance from U.S. Appl. No. 11/457,090 mailed Jul. 26, 2010.
USPTO, Notice of Allowance from U.S. Appl. No. 11/457,103 mailed Mar. 8, 2010.
Chiranjit, Acharya, U.S. Appl. No. 12/620,499, filed Nov. 17, 2009.
Milano, et al., “Using Ontologies for XML Data Cleaning”, OTM Workshops, 2005, pp. 562-571.

Affiliated with

Also associated with

Rating

Method and system for subspace bounded recursive clustering... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and system for subspace bounded recursive clustering..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system for subspace bounded recursive clustering... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4306049