IDEAS home Printed from https://ideas.repec.org/p/gro/rugsom/96b34.html
   My bibliography  Save this paper

Semiparametric estimation of (constrained) ultrametric trees

Author

Listed:
  • Wedel, Michel
  • DeSarbo, Wayne S.

    (Groningen University)

Abstract

This paper introduces a general, formal treatment of dynamic constraints, i.e., constraints on the state changes that are allowed in a given state space. Such dynamic constraints can be seen as representations of "real world" constraints in a managerial context. The notions of transition, reversible and irreversible transition, and transition relation will be introduced. The link with Kripke models (for modal logics) is also made explicit. Several (subtle) examples of dynamic constraints will be given. Some important classes of dynamic constraints in a database context will be identified, e.g. various forms of cumulativity, non-decreasing values, constraints on initial and final values, life cycles, changing life cycles, and transition and constant dependencies. Several properties of these dependencies will be treated. For instance, it turns out that functional dependencies can be considered as "degenerated" transition dependencies. Also, the distinction between primary keys and alternate keys is reexamined, from a dynamic point of view.

Suggested Citation

  • Wedel, Michel & DeSarbo, Wayne S., 1996. "Semiparametric estimation of (constrained) ultrametric trees," Research Report 96B34, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    • Handle: RePEc:gro:rugsom:96b34
    as

    Download full text from publisher

    File URL: http://irs.ub.rug.nl/ppn/155260723
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. James Corter & Amos Tversky, 1986. "Extended similarity trees," Psychometrika, Springer;The Psychometric Society, vol. 51(3), pages 429-451, September.
    2. Hamparsum Bozdogan, 1987. "Model selection and Akaike's Information Criterion (AIC): The general theory and its analytical extensions," Psychometrika, Springer;The Psychometric Society, vol. 52(3), pages 345-370, September.
    3. J. Carroll & Linda Clark & Wayne DeSarbo, 1984. "The representation of three-way proximity data by single and multiple tree structure models," Journal of Classification, Springer;The Classification Society, vol. 1(1), pages 25-74, December.
    4. Wayne DeSarbo & Vijay Mahajan, 1984. "Constrained classification: The use of a priori information in cluster analysis," Psychometrika, Springer;The Psychometric Society, vol. 49(2), pages 187-215, June.
    5. Michel Wedel & Wayne DeSarbo, 1995. "A mixture likelihood approach for generalized linear models," Journal of Classification, Springer;The Classification Society, vol. 12(1), pages 21-55, March.
    6. Stephen Johnson, 1967. "Hierarchical clustering schemes," Psychometrika, Springer;The Psychometric Society, vol. 32(3), pages 241-254, September.
    7. Jamshidian, Mortaza & Bentler, Peter M., 1993. "A modified Newton method for constrained estimation in covariance structure analysis," Computational Statistics & Data Analysis, Elsevier, vol. 15(2), pages 133-146, February.
    8. Shmuel Sattath & Amos Tversky, 1977. "Additive similarity trees," Psychometrika, Springer;The Psychometric Society, vol. 42(3), pages 319-345, September.
    9. Rao, Vithala R & Sabavala, Darius Jal, 1981. "Inference in Hierarchical Choice Processes from Panel Data," Journal of Consumer Research, Journal of Consumer Research Inc., vol. 8(1), pages 85-96, June.
    10. Greg M. Allenby, 1989. "A Unified Approach to Identifying, Estimating and Testing Demand Structures with Aggregate Scanner Data," Marketing Science, INFORMS, vol. 8(3), pages 265-280.
    11. J. Carroll, 1976. "Spatial, non-spatial and hybrid models for scaling," Psychometrika, Springer;The Psychometric Society, vol. 41(4), pages 439-463, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. repec:dgr:rugsom:96b34 is not listed on IDEAS
    2. Michel Wedel & Wayne DeSarbo, 1998. "Mixtures of (constrained) ultrametric trees," Psychometrika, Springer;The Psychometric Society, vol. 63(4), pages 419-443, December.
    3. Simon Blanchard & Wayne DeSarbo, 2013. "A New Zero-Inflated Negative Binomial Methodology for Latent Category Identification," Psychometrika, Springer;The Psychometric Society, vol. 78(2), pages 322-340, April.
    4. Bocci, Laura & Vicari, Donatella & Vichi, Maurizio, 2006. "A mixture model for the classification of three-way proximity data," Computational Statistics & Data Analysis, Elsevier, vol. 50(7), pages 1625-1654, April.
    5. Geert Soete, 1986. "Optimal variable weighting for ultrametric and additive tree clustering," Quality & Quantity: International Journal of Methodology, Springer, vol. 20(2), pages 169-180, June.
    6. J. Hutchinson & Amitabh Mungale, 1997. "Pairwise partitioning: A nonmetric algorithm for identifying feature-based similarity structures," Psychometrika, Springer;The Psychometric Society, vol. 62(1), pages 85-117, March.
    7. Wayne DeSarbo & Michael Johnson & Ajay Manrai & Lalita Manrai & Elizabeth Edwards, 1992. "Tscale: A new multidimensional scaling procedure based on tversky's contrast model," Psychometrika, Springer;The Psychometric Society, vol. 57(1), pages 43-69, March.
    8. Geert Soete & Wayne DeSarbo & J. Carroll, 1985. "Optimal variable weighting for hierarchical clustering: An alternating least-squares algorithm," Journal of Classification, Springer;The Classification Society, vol. 2(1), pages 173-192, December.
    9. Salvatore Ingrassia & Antonio Punzo & Giorgio Vittadini & Simona Minotti, 2015. "Erratum to: The Generalized Linear Mixed Cluster-Weighted Model," Journal of Classification, Springer;The Classification Society, vol. 32(2), pages 327-355, July.
    10. J. Carroll & James Corter, 1995. "A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees," Journal of Classification, Springer;The Classification Society, vol. 12(2), pages 283-313, September.
    11. Ana Oliveira-Brochado & Francisco Vitorino Martins, 2008. "Aspectos Metodológicos da Segmentação de Mercado: Base de Segmentação e Métodos de Classificação," FEP Working Papers 261, Universidade do Porto, Faculdade de Economia do Porto.
    12. Ana Oliveira-Brochado & Francisco Vitorino Martins, 2014. "Identifying Small Market Segments with Mixture Regression Models," International Journal of Finance, Insurance and Risk Management, International Journal of Finance, Insurance and Risk Management, vol. 4(4), pages 812-812.
    13. Lant, Theresa & Shapira, Zur, 2008. "Managerial reasoning about aspirations and expectations," Journal of Economic Behavior & Organization, Elsevier, vol. 66(1), pages 60-73, April.
    14. K. Klauer & J. Carroll, 1991. "A comparison of two approaches to fitting directed graphs to nonsymmetric proximity measures," Journal of Classification, Springer;The Classification Society, vol. 8(2), pages 251-268, December.
    15. Tatjana Miljkovic & Daniel Fernández, 2018. "On Two Mixture-Based Clustering Approaches Used in Modeling an Insurance Portfolio," Risks, MDPI, vol. 6(2), pages 1-18, May.
    16. A. Penttinen & W. Krzanowski & J. Kettenring & F. Rohlf & William Day & B. Weir & John Kececioglu & N. Ohsumi & Peter Willett, 1993. "Book reviews," Journal of Classification, Springer;The Classification Society, vol. 10(1), pages 125-156, January.
    17. Boter, Jaap & Rouwendal, Jan & Wedel, Michel, 2004. "Employing Travel Costs to Compare the Use Value of Competing Cultural Organizations," Serie Research Memoranda 0011, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    18. Salvatore Ingrassia & Antonio Punzo & Giorgio Vittadini & Simona Minotti, 2015. "The Generalized Linear Mixed Cluster-Weighted Model," Journal of Classification, Springer;The Classification Society, vol. 32(1), pages 85-113, April.
    19. Olga Fajarda & Cristina Requejo, 2022. "MIP model-based heuristics for the minimum weighted tree reconstruction problem," Operational Research, Springer, vol. 22(3), pages 2305-2342, July.
    20. Fernández, D. & Arnold, R. & Pledger, S., 2016. "Mixture-based clustering for the ordered stereotype model," Computational Statistics & Data Analysis, Elsevier, vol. 93(C), pages 46-75.
    21. Fortz, Bernard & Oliveira, Olga & Requejo, Cristina, 2017. "Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem," European Journal of Operational Research, Elsevier, vol. 256(1), pages 242-251.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gro:rugsom:96b34. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Hanneke Tamling (email available below). General contact details of provider: https://edirc.repec.org/data/ferugnl.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.