Learning Spaces

Falmagne, Jean‐Claude; Doignon, Jean-Paul

doi:10.1007/978-3-642-01039-2

Cited by 131 publications

(146 citation statements)

References 0 publications

Supporting

Mentioning

143

Contrasting

Unclassified

Order By: Relevance

“…To review the clinical reports on the effect of memantine in manic symptoms in psychiatric syndromes other than bipolar disorder, we use a new methodological approach: Formal Psychological Assessment (FPA) [103][104][105] ; From a theoretical-mathematical perspective, FPA jointly applies two theories from mathematical psychology: The Knowledge Spaces Theory (KST) [106][107][108] and in the Formal Concept Analysis (FCA) [109,110] . The FPA provides a strong methodological approach based on the construction of a Boolean matrix that relates the so-called objects and attributes.…”

Section: Memantine In "Manic Symptoms" In Psychiatric Syndromes Othermentioning

confidence: 99%

Memantine: New prospective in bipolar disorder treatment

Serra

Demontis

Serra

et al. 2014

WJP

View full text Add to dashboard Cite

Section: Memantine In "Manic Symptoms" In Psychiatric Syndromes Othermentioning

confidence: 99%

Memantine: New prospective in bipolar disorder treatment

Serra

Demontis

Serra

et al. 2014

WJP

View full text Add to dashboard Cite

“…Korte et al [21] considered antimatroids as a subclass of greedoids. Today, the concept of antimatroid appears in many fields of mathematics such as formal language theory (Boyd and Faigle [3]), choice theory (Koshevoy [22]), game theory (Algaba et al [1]) and mathematical psychology (Falmagne and Doignon [13]) among others. We became recently aware of more works on optimization in antimatroids, in particular Queyranne and Wolsey [28,29].…”

Section: Antimatroidsmentioning

confidence: 99%

On the shelling antimatroids of split graphs

Merckx

Cardinal

Doignon

2016

Electronic Notes in Discrete Mathematics

Self Cite

View full text Add to dashboard Cite

Chordal graph shelling antimatroids have received little attention with regard to their combinatorial properties and related optimization problems, as compared to the case of poset shelling antimatroids. Here we consider a special case of these antimatroids, namely the split graph shelling antimatroids. We show that the feasible sets of such an antimatroid relate to some poset shelling antimatroids constructed from the graph. We discuss a few applications, obtaining in particular a simple polynomial-time algorithm to find a maximum weight feasible set. We also provide a simple description of the circuits and the free sets.

show abstract

“…In the theory of knowledge structures (Doignon & Falmagne, 1985, 1999Falmagne & Doignon, 2011), a domain of knowledge is a collection Q of problems or items (e.g., all problems that can be formulated in linear algebra), and the state of knowledge of an individual is the particular subset K ⊆ Q of problems that he or she is capable of solving. A knowledge structure is a collection of knowledge states, and in practical applications of the theory it represents all different knowledge states existing in a given population.…”

Section: Introductionmentioning

confidence: 99%

Assessing the local identifiability of probabilistic knowledge structures

et al. 2012

View full text Add to dashboard Cite

Given a collection Q of problems, in knowledge space theory Doignon & Falmagne, (International Journal of Man-Machine Studies 23:175-196, 1985) the knowledge state of a student is the collection K ⊆ Q of all problems that this student is capable of solving. A knowledge structure is a pair (Q, ), where is a collection of knowledge states that contains at least the empty set and Q. A probabilistic knowledge structure (PKS) is a knowledge structure (Q, , π), where π is a probability distribution on the knowledge states. The PKS that has received the most attention is the basic local independence model BLIM; Falmagne & Doignon, (British Journal of Mathematical and Statistical Psychology 41: 1-23, 1988a, Journal of Mathematical Psychology 32:232-258, 1988b. To the best of our knowledge, systematic investigations in the literature concerning the identifiability of the BLIM are totally missing. Based on the theoretical work of Bamber and van Santen (Journal of Mathematical Psychology 29:443-473, 1985), the present article is aimed to present a method and a corresponding computerized procedure for assessing the local identifiability of the BLIM, which is applicable to any finite knowledge structure of moderate size.

show abstract

Learning Spaces

Cited by 131 publications

References 0 publications

Memantine: New prospective in bipolar disorder treatment

Memantine: New prospective in bipolar disorder treatment

On the shelling antimatroids of split graphs

Assessing the local identifiability of probabilistic knowledge structures

Contact Info

Product

Resources

About