Method and apparatus for simmered greedy optimization

Details Method and apparatus for simmered greedy optimization Method and apparatus for simmered greedy optimization

2007-08-27

2010-12-14

Sparks, Donald (Department: 2129)

Data processing: artificial intelligence

Adaptive system

Reexamination Certificate

active

07853541

ABSTRACT:
A method and apparatus comprising a fast and highly effective stochastic algorithm, referred to as Simmered Greedy Optimization (SG(N)), for solving combinatorial optimization problems, including the co-clustering problem comprising simultaneously clustering two finite sets by maximizing the mutual information between the clusterings and deriving maximally predictive feature sets. Co-clustering has found application in many areas, particularly statistical natural language processing and bio-informatics. Provided are results of tests on a suite of statistical natural language problems comparing SG(N) with simulated annealing and a publicly available implementation of co-clustering, wherein using SG(N) provided superior results with far less computation.

REFERENCES:
patent: 5745735 (1998-04-01), Cohn et al.
patent: 6453245 (2002-09-01), Rothberg et al.
patent: 2005/0187711 (2005-08-01), Agrawala et al.

Affiliated with

Also associated with

Rating

Method and apparatus for simmered greedy optimization 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 apparatus for simmered greedy optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for simmered greedy optimization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4170538