Ordinal and Relational Clustering

Ordinal and Relational Clustering

Volumn , Issue , 2010, Pages 1-179

  Janowitz, Melvin F ^a  

^a Rutgers University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85125323703     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1142/7449     Document Type: Book

References (66)

1. Abbott, J. C. (1969) Sets, Lattices and Boolean Algebras, Allyn and Bacon.
2. Bandelt, H.-J. (1992). Four point characterization of the dissimilarity functions from indexed closed weak hierarchies, Mathematsches Seminar, Universität Hamburg.
3. Barthéemy, J.-P. and Guénoche, A. (1991). Trees and Proximity Representation, Wiley, West Sussex.
4. Baulieu, F. (1985). Order theoretic classification of monotone equivariant cluster methods, Algebra Universalis 20 pp. 251–267.
5. Baulieu, F. (1991). Classification of normalized cluster methods in an order theoretic model, Discrete Applied Math. 32, pp. 1–29.
6. Baulieu, F. (1989). A Classification of Presence/absence Based Dissimilarity Coefficients, Journal of Classification 6, pp. 233–246.
7. F. Baulieu (1997). Two Variant Axiom Systems for Presence/absence Based Dissimilarity Coefficients, Journal of Classification 14 pp. 159–170.
8. Benzénzecri, J.-P. L’Analyse des données: la Taxonomie, Dunod, Paris.
9. Berge, C. (1973) Graphs and Hypergraphs, North-Holland mathematical library, v. 6, rev. ed.
10. Bertrand, P. (2000) Set systems and Dissimilarities, European Journal of Combina-torics 21, pp. 727–743.
11. Bertrand, P. and Janowitz, M. F. (2002). Pyramids and wweak hierarchies in the ordinal model for clustering, Discrete Applied Mathematics 122. pp. 55–81
12. Bertrand, P. and Janowitz, M. F. (2003) The k-weak hierarchical representations: an extension of the indexed closed weak hierarchies, Discrete Applied Mathematics 127, pp. 199–220.
13. Billard, L. and Diday, E. (2008) Symbolic Data Analysis: Conceptual Statistics and Data Mining, Wiley, Chichester.
14. Birkhoff, G. (1967). Lattice Theory, third ed., American Mathematical Society, Providence.
15. Blyth, T. S. and Janowitz, M. F. (1972). Residuation Theory, Pergamon Press, Oxford.
16. A. Bouchard–Côté, Solving Polynimomials: The roots of modern algebra, http://www.cs.berkeley.edu/~bouchard/pub/termPaper3.pdf
17. Coifman, R. R. and Maggioni, M. (2008) Geometry analysis and signal processing on digital data, emergent structures, and knowledge building, SIAM News 41, December, 2008, p. 1.
18. Davey, B. A. and Priestley, H. A. (1990). Introduction to Lattices and Order, Cambridge Univeristy Press, Cambridge.
19. Diatta, J. (2004). A relation between the theory of formal concepts and multiway clustering, Pattern Recognition Letters 25, pp. 183–189.
20. Diatta, J. (1997) Dissimilaratés multivoies et générisations d’hypergraphes sans triangles, Math. Inf. Sci. hum. 138, pp. 57–73.
21. Diatta, J. (to appear). Galois closed entity sets and k-balls of quasi-ultrametric multiway dissimilarities. i
22. Diatta, J. and Fichet, B. (1998). Quasi-ultrametrics and their 2-ball hypergraphs, Discrete Mathematics 192, pp. 87–102.
23. Diatta, J. and Ralambondrainy, H. (2002). The conceptial weak hierarchy associated with a disiimilarity measure, Mathematical Social Sciences 44, pp. 301–319.
24. Driscoll, T. (2009). Learning MATLAB Society for Industrial and Applied Mathematics, Phildelphia.
25. Fishburn, Peter C. (1985) Interval orders and interval graphs: Study of partially ordered sets, Wiley-Interscience Series in Discrete Mathematics.
26. Ganter, B. and Wille, R. (1999) Formal Concept Analysis. Mathematical Foundations, Springer-Verlag, Berlin.
27. Ganter B. and Wille, R. (1996). Formale Begriffsanalyse. Mathematische Grundlagen, Springer-Verlag, Berlin.
28. Gordon, A. D. (1999). Classification, 2nd ed., Chapman & Hall, London.
29. Gower, J. C. and Legendre, P. (1986). Metric and Euclidean properties of dissimilarity coefficients. Journal of Classification 3, pp. 5–48.
30. Hartigan, J. A. (1975). Clustering Algorithms, Wiley, New York.
31. Hubert, L. (1977). A set theoretical approach to the problem of hierarchical clustering, J. Math. Psych. 15, pp. 70–88.
32. Jain, A. K. and Dubes, R. C. (1988). Algorithms for Clustering Data, Prentice-Hall, Englewood Cliffs.
33. Janowitz, M. F. (1978). An order theoretic model for cluster analysis, SIAM J. Applied Math. 34, pp. 55–72.
34. Janowitz, M. F. (1978). Semiflat L-cluster methods, Discrete Math. 21, pp. 47–60.
35. Janowitz, M. F. (1979). Monotone equivariant cluster methods, SIAM J. App. Math. 37, pp. 148–165.
36. Janowitz, M. F. (1979). Preservation of Global Order Equivalence, Journal of Math. Psych. 20, PP. 78–88.
37. Janowitz, M. F. (1980) Applications of the theory of partially ordered sets to cluster analysis, in “Universal Algebra and Applications”, Banach Center Publications 9, PP. 305–319.
38. Janowitz, M. F. (1981). Continuous L-cluster methods, Discrete Applied Mathematics 3, pp. 107–112.
39. Janowitz, M. F. and Schweizer, B. (1989). Ordinal and percentile clustering, Mathematical Social Sciences 18, pp. 135–186.
40. Janowitz, M. F. and Wille, R. (1995) On the classification of monotone–equivariant cluster methods, in “Partitioning Data Sets”, Hansen, P. et al eds., vol. 19, DI-MACS Series in Discrete Mathematics and Theoretical Computer Science, American Math. Society, Providence, pp. 117–141.
41. Jardine, N. and Sibson, R. (1968). The construction of hierarchic and non-hierarchic classifications, Computer Journal 11, pp. 177–184.
42. Jardine, N. and Sibson, R.(1968). A model for taxonomy, Math. Biosci. 2, pp. 465– 482.
43. Jardine, N. and Sibson, R. (1971). Choice of methods for automatic classification Computer Journal 14, pp. 404–406.
44. Jardine, N. and Sibson, R. (1971). Mathematical Taxonomy, Wiley, New York.
45. Jones, N. C. and Pevzner, P. A. (2004). An Introduction to Bioinformatics Algorithms, MIT Press, Cambridge.
46. Krantz, D., Luce, R. D., Suppes, P. and Tversky, A. (2007). Foundations of Measurement, Vol. I: Additive and Polynomial Representations Dover, New York.
47. Lay, S. (1998). Analysis, An Introduction to Proof, Prentice-Hall, Englewood Cliffs.
48. Legendre, P. and Legendre, L. (1998) Numerical Ecology, Second English Edition, Elsevier, Amsterdam.
49. Matula, D. W. (1976) Graph Theoretic Techniques for Cluster Analysis Algorithms, in “Classification and Clustering”, ed. J. van Ryzin, Academic Press, New York, pp. 95–129.
50. McKee, T. A. and McMorris, F. R. (1999) Topics in Intersection Graph Theory, SIAM, Philadelphia, 1999.
51. Mirkin, B. (1996. Mathematical Classification and Clustering Kluwer, Dodrecht.
52. Pratap, R. (2006). Getting Started with MATLAB 7, Oxford University Press. New York
53. Powers, R. C. (1988). Order Theoretic Classification of Percentile Cluster Methods, Ph.D. dissertation, University of Massachusetts, Amherst.
54. Rahini, A. and Recht, B. (2004). Clustering with normalized cuts is clustering with a hyperplane in “Statistical Learning in Computer Vision”.
55. Roberts, F. S. (1979). Measurement Theory, with Applications to Decision Theory, Utility and the Social Sciences, Addison-Wesley, Reading.
56. Roberts, F. S. (1984). On the theory of mraniningfulness of ordinal comparisons in measurement Measurement 2, pp. 35–38.
57. Roberts, F. S. and Spencer, J. H. A characterization of clique graphs J. Combin. Theory Ser. B 10, pp. 102–108.
58. Schweizer, B. and Sklar, A. (1983). Probabilistic Metric Spaces, North-Holland, New York.
59. Shi, J. and Malik, J. (2000). Normalized cuts and image segmentation, IEEE Transactions on Pattern Analysis and Machine Intel ligence, 22, pp. 888–905.
60. Sibson, R. (1970). A model for taxonomy II, Math. Biosci. 6, pp. 405–430.
61. Sibson, R. (1972). Order invariant methods for data analysis Journal of the Royal Statistical Society, Series B 34, PP. 311–349.
62. Sneath, P. H. A. A comparison of different clustering methods as applied to randomly spaced points Classification Society Bul l. 1, pp. 2–18.
63. Sneath, P. H. A. and Sokal, R. R. (1973). Numerical Taxonomy, W. H. Freeman, San Francisco.
64. Szasz, G. (1963). Introduction to Lattice Theory, 3rd ed. rev., Academic Press, New York.
65. Tomitaa, E., Tanaka, A. and Takahashi, H. (2006). The worst–case time complexity for generating all maximal cliques and computational experimants Theoretical Computer Science 303 pp. 28–42.
66. Bureau of Justice Statistics Crime & Justice Data Online, http://bjsdata.ojp. usdoj.gov/dataonline/Search/Crime/State/statebystaterun.cfm?stateid=31