3
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

An Intelligent Search for Clustering

& , FIETE
Pages 258-265 | Published online: 02 Jun 2015

REFERENCES

  • J MacQueen, Some methods for classification and analysis of multivariate observations, Proc 5th Berkeley Symp, vol 1, pp 281–297, 1966.
  • G H Ball & D J Hall, ISODATA—A novel method of data analysis and pattern classification, Tech Rep SRI Project 5533, Stanford Res. Institute, Menlo Park, Calif, May 1973.
  • J J Fortier & H Solomon, Clustering procedures in Multivariate Analysis, (Ed P R Krishnaiah) New York Academic, 1966, pp 493–506.
  • K Fukunaga, Introduction to Statistical Pattern Recognition, New York Academic, 1972.
  • J A Hartigan, Clustering Alogrithms, New York Wiley, 1975.
  • M R Anderbarg, Cluster Analysis for Applications, New York, Academic, 1973.
  • E R Ruspini, A new approach to clustering, Inform Contr, vol 15, pp 22–32, 1969.
  • E R Ruspini, New experimental results in fuzzy clustering, Inform Sci, vol 6, pp 22–32, 1973.
  • J C Bezdek, Fuzzy mathematics in pattern classification, PhD dissertation, Canter for Appl. Math, Cornell University, Ithaca, NY, 1973.
  • J C Bezdek, A physical interpretation of fuzzy ISODATA, IEEE Trans Syst Man, Cybern, vol SMC-6, pp 387–390, 1976.
  • R Dubes & A K Jain, Cluster methodologies in exploratory data analysis, Advances in Comput, vol 19, pp 113–228, 1980.
  • R Dubes & A K Jain, Clustering technique—The user's delemma, Pattern Recognition, vol 8, pp 247–260, 1976.
  • J E Mezzich, Evaluating clustering methods for psychiatric dianosis, Biol Psychiatry, vol 13, pp 265–281, 1978.
  • A J Boyee, Mapping diversity A comparative study of some numerical methods, in Numerical Taxonomy, (Ed. A J Cole), New York Academic, 1969, pp 1–31.
  • S W Golomb & L D Baumert, Backtrack programming, J Ass Comput March, vol 12, pp 516–524, Jan 1965.
  • A L Chernyavski, Algorithms for the solution of combinatorial problems based on a method of implicit enumeration, Automat Remote Cont, vol 33, pp 252–260, Feb 1972.
  • E L Lawler & E E Wood, Branch-and-bound methods a survey, Oper Res, vol 149, pp 699–719, 1966.
  • T Ibaraki, The power of dominance relations in branch-and-bound algorithms, J ACM-24, vol 2, pp 264–279, Apr 1977.
  • N J Nilsson, Principles of Artificial Intelligence, Springer-verlag, 1982.
  • J Pearl, Heuristics Intelligent search strategies for computer problem solving. Addition-Wesley, 1984.
  • A Bagchi & A Mahanti, Search algorithm under different kinds of heuristics—A comparative study, J ACM 30, vol 1, pp 1–21, 1983.
  • I Aleksander, H Farreny & M Ghallan, Decision and Intelligence, Kogan Page, 1986.
  • T S Arthanari, On some problems in sequencing and grouping, Unpublished doctoral dissertation, Indian Statistical Institute, Calcutta, 1974.
  • R E Jensen, A dynamic programming algorithm for cluster analysis, Optr Res, vol 7, pp 1034–1057, 1969.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.