Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2007-10-02
2007-10-02
Wong, Don (Department: 2163)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000
Reexamination Certificate
active
10901278
ABSTRACT:
The present invention is directed to the use of an evolutionary algorithm to locate optimal solution subspaces. The evolutionary algorithm uses a point-based coding of the subspace determination problem and searches selectively over the space of possible coded solutions. Each feasible solution to the problem, or individual in the population of feasible solutions, is coded as a string, which facilitates use of the evolutionary algorithm to determine the optimal solution to the fitness function. The fitness of each string is determined by solving the objective function for that string. The resulting fitness value can then be converted to a rank, and all of the members of the population of solutions can be evaluated using selection, crossover, and mutation processes that are applied sequentially and iteratively to the individuals in the population of solutions. The population of solutions is updated as the individuals in the population evolve and converge, that is become increasingly genetically similar to one another. The iterations of selection, crossover and mutation are performed until a desired level of convergence among the individuals in the population of solutions has been achieved.
REFERENCES:
patent: 6052082 (2000-04-01), Hassan et al.
patent: 6571227 (2003-05-01), Agrafiotis et al.
patent: 6968517 (2005-11-01), McConaghy
I. T. Jolliffe. Principal Component Analysis, Springer-Verlag, New York, 1986.
S. Kirkpatrick, C. D. Gelatt, M. P. Vecchi. Optimizationby Simulated Annealing. Science (220) (4589): pp. 671-680, 1983.
J. Kleinberg, A. Tomkins. Applications of Linear Algebra in Information Retrieval and Hypertext Analysis. ACM PODS Conference Proceedings, 1999.
C.-H. Papadimitriou, P. Raghavan, H. Tamaki, S. Vempala. Latent Semantic Indexing: A Probabilistic Analysis. ACM PODS Conference Proceedings, pp. 159-168, 1998.
K. V. Ravi Kanth, D. Agrawal, A. Singh. Dimensionality Reduction for Similarity Search in Dynamic Databases. ACM SIGMOD Conference Proceedings, 1998.
A.K.Jain, et al. Data Clustering: A Review, ACM Computing Surveys, vol. 31, No. 3, Sep. 1999.
C. Aggarwal. Hierarchical Subspace Sampling:A Unified Framework for High Dimensional Data Reduction, Selectivity Estimation and Nearest Neighbor Search.ACM SIGMOD Conf. 2002.
K. Beyer et al. When is Nearest Neighbors Meaningful?, ICDT Conference, 1999.
K. Chakrabarti, S. Mehrotra. Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces. VLDB Conference Proceedings, 2000.
K. A. De Jong. Analysis of the behaviour of a class of Genetic Adaptive Systems. Ph. D. Dissertation, University of Michigan, Ann Arbor, MI, 1975.
C. Faloutsos, K.-I. Lin. FastMap: A Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Datasets. ACM SIGMOD Conference Proceedings, 1995.
D. E. Goldberg. Genetic algorithms in search,optimization and machine learning. Addison Wesley, Reading, MA,1989.
A. Hinneburg, C. C. Aggarwal, D. A. Keim. What is the Nearest Neighbor in High Dimensional Spaces? VLDB Conference Proceedings, 2000.
J. H. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor MI 1975.
A. Jain, R. Dubes. Algorithms for Clustering Data.Prentice Hall, New Jersey, 1998.
August Law Group LLC
Filipczyk Marc R
Willinghan, III George A.
Wong Don
LandOfFree
System and method of flexible data reduction for arbitrary... 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 of flexible data reduction for arbitrary..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method of flexible data reduction for arbitrary... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3868015