Annealing by two sets of interactive dynamics

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 34, Issue 3, 2004, Pages 1519-1525

  Wu, Jiann Ming ^a  

^a NATIONAL DONG HWA UNIVERSITY   (Taiwan)

Author keywords

Combinatorial optimizations; Graph bisection problem; Hopfield neural networks; Mean field annealing

Indexed keywords

APPROXIMATION THEORY; GRAPH THEORY; OPTIMIZATION; SIMULATED ANNEALING;

COMBINATORIAL OPTIMIZATION; GRAPH BISECTION PROBLEM;

NEURAL NETWORKS;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; COMPARATIVE STUDY; EVALUATION; MATHEMATICAL COMPUTING; NERVE CELL NETWORK; NONLINEAR SYSTEM; STATISTICAL MODEL; VALIDATION STUDY;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; MODELS, STATISTICAL; NERVE NET; NONLINEAR DYNAMICS; NUMERICAL ANALYSIS, COMPUTER-ASSISTED;

EID: 2942511432     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCB.2004.826395     Document Type: Article

References (20)

1. R. Battiti and A. A. Bertossi "Greedy, prohibition, and reactive heuristics for graph partitioning," IEEE Trans. Comput., vol. 48, pp. 361-385, Apr. 1999.
2. S. Boettcher and A. Percus, "Nature's way of optimizing," Artif. Intell., vol. 119, no. 1-2, pp. 275-286, May 2000.
3. J. J. Hopfield and D. W. Tank, "Neural computation of decisions in optimization problems," Biol. Cybern., vol. 52, p. 141, 1985.
4. D. S. Jonson, C. R. Aragon, L. A. McGeoch, and C. Schevon, "optimization by simulated annealing: An experimental evaluation; Part II, Graph coloring and number partitioning," Oper. Res., vol. 39, pp. 378-406, 1991.
5. C. Y. Liou and J. M. Wu, "Self-organization using Potts models," Neural Netw., vol. 9, no. 4, pp. 671-684, 1996.
6. P. Merz and B. Freislenben, "Memetic algorithms and the fitness landscape of the graph bi-partitioning problem," Lect. Notes Comput Sci., vol. 1498, pp. 765-774, 1998.
7. K. Nakanishi and H. Takayama, "Mean-field theory for a spin-glass model of neural networks: TAP free energy and the paramagnetic to spin-glass transition," J. Phys. A, Math. Gen., vol. 30, no. 23, pp. 8085-8094, Dec. 7, 1997.
8. M. Opper and O. Winther, "Gaussian processes for classification: Meanfield algorithms," Neural Comput., vol. 12, no. 11, pp. 2655-2684, Nov. 9, 2000. no. 4, 671-684.
9. C. Peterson and B. Söderberg, "A new method for mapping optimization problems onto neural network," Int. J. Neural Syst., vol. 1, p. 3, 1989.
10. A. V. Rao, D. J. Miller, K. Rose, and A. Gersho, "A deterministic annealing approach for parsimonious design of piecewise regression models," IEEE Trans. Pattern Anal. Machine Intell., vol. 21, pp. 169-173, Feb. 1999.
11. K. Rose, E. Gurewitz, and G. C. Fox, "Statistical mechanics and phase transitions in clustering," Phys. Rev. Lett., vol. 65, no. 8, pp. 945-948, 1990.
12. ____, "Constrained clustering as an optimization method," IEEE Trans. Pattern Anal. Machine Intell., vol. 15, pp. 785-794, Aug. 1993.
13. M. Shamir and H. Sompolinsky, "Thouless-anderson-palmer equations for neural networks," Phys. Rev. E, Stat. Phys. Plasmas Fluids Relat., vol. 61. no. 2, pp. 1839-1844, Feb. 2000.
14. N. B. Thang and B. Moon, "Genetic algorithm and graph partitioning," IEEE Trans. Comput., vol. 45, pp. 841-855, July 1996.
15. D. W. Tank and J. J. Hopfield, "Collective computation in neuronlike circuits," Sci. Amer., vol. 257, no. 6, pp. 104-115, 1987.
16. ____, "Simple neural optimization networks: An A/D converter, signal decision circuit, and a linear programming Circuit," IEEE Trans. Circuits Syst. I, vol. CA-33, pp. 511-525, May 1986.
17. D. J. Thouless, P. W. Anderson, and R. G. Plamer, "Solution of solvable model of a spin glass," Philos. Mag., vol. 35, no. 3, pp. 593-601, 1977.
18. J. M. Wu, "Potts models with two sets of interactive dynamics," Neurocomput., vol. 34, pp. 55-77, Sept. 2000.
19. J. M. Wu and S. J. Chiu, "Independent component analysis using Potts models," IEEE Trans. Neural Networks, vol. 12, pp. 202-211, Mar. 2001.
20. J. M. Wu, "Natural discriminant analysis using interactive Potts models," Neural Comput., vol. 14, no. 3, 2002.