|
Results for criterions:- Topic: Trees
Modify search criterions
Results n° 1 to 8 of 45 matches
| Title |
Log periodic evolution of monastic orders |
| Author |
BRISSAUD Ivan |
| Keywords |
Log periodicity law, Monastic orders, Temporal tree structure |
| Topics |
History, Periodic functions, Time Series, Trees |
| Abstract |
After the VIth century various religious and monastic orders, all of which influenced the social, economical and political life of their time, succeeded each other. These orders all attempted to promote a stricter respect of the fundamental (religious) rules. But failing to achieve this goal, each order was supplanted by a new one. The succession of jumps in this evolutionary tree shows an acceleration between Benedictine up to Mendicant orders (XIIIth century) similar to what has been observed for various phenomena (evolution of hominidae, financial market crash, earthquake.). This suggests that it might be relevant to apply a log periodic system to this chronology. The deduced values of the critical times and of the self similarity factor are Tc = 1290+/-40 and g = 2,14+/-0,30. No deceleration steps are observed after Tc. This could be explained by the predominance of the secular clergy. |
| Number |
188, Winter 2009 |
| Language |
 French | Read the article
| Title |
A new clustering method for interval data |
| Author |
HARDY André, KASORO Nathanael |
| Keywords |
Clustering, Decision tree, Hypervolumes criterion, Maximum likelihood, Poisson Process |
| Topics |
Classification - Clustering - Partitioning, Statistics, Trees |
| Abstract |
This paper presents a new clustering method for interval data. It is an extension of a classical clustering method to interval data. The classical procedure is based on the theory of point processes, and more particularly on the homogeneous Poisson process. The first part of the new method is a monothetic divisive procedure. The cut rule is an extension to interval data of the Hypervolumes clustering criterion. The pruning step uses two statistical likelihood ratio tests based on the homogeneous Poisson process: the Hypervolumes test and the Gap test. The output is a decision tree. The second part of the method is a merging process, that allows in particular cases to improve the classification obtained at the end of the first part of the algorithm. The method is applied to a generated data set and to a real data set. It is compared with other clustering methods available for interval data. |
| Number |
187, Fall 2009, special issue: 2007 Meeting of the French-speaking Society of Classification |
| Language |
French | Read the article
| Title |
Tree construction starting from betweenness relations, application to the stemma codicum |
| Author |
LE POULIQUEN Marc, BARTHELEMY Jean-Pierre |
| Keywords |
Betweenness, Filiation of manuscripts, Stemma codicum, Tree |
| Topics |
Classification - Clustering - Partitioning, Literature, Trees |
| Abstract |
In this paper, we model the ternary betweenness relation within the framework of the critical edition of texts. The editor must try to reconstruct as well as possible, starting from the various preserved manuscripts, the original manuscript as the author wrote it. The corpus is made up of many manuscripts which are copied from one another. To do so, it appears interesting to draw up a family tree of these manuscripts called stemma codicum. A manuscript B is between the manuscripts A and C, i.e. the manuscript C was copied starting from the manuscript B which itself was copied from A. This is this concept of betweenness by copy act which one wishes to model. |
| Number |
187, Fall 2009, special issue: 2007 Meeting of the French-speaking Society of Classification |
| Language |
French | Read the article
| Title |
Text formal reductions for tree analysis and automatic classification. Application to a latin historians corpus |
| Author |
MELLET Sylvie, LUONG Nguyen Xuan, LONGREE Dominique, BARTHELEMY Jean-Pierre |
| Keywords |
Generic classification, Lattice, Linear textual structures, Motif (pattern), Neighbourhood, Texts topological approach, Tree analysis |
| Topics |
Classification - Clustering - Partitioning, Lattices, Literature, Trees |
| Abstract |
In this paper, we present different methods of automatic classification applied to a corpus of literary texts and we compare their different results; in particular we evaluate how each of them is suitable for exhibiting the generic classification of the corpus. We demonstrate that a topological approach of the texts which takes into account their linearity, i.e. the order of their micro- and macro-structures, results in better clustering than traditional quantitative methods which leave generally out of count this linear structure. |
| Number |
187, Fall 2009, special issue: 2007 Meeting of the French-speaking Society of Classification |
| Language |
French | Read the article
| Title |
Tree representations of qualitative proximities |
| Author |
BURIGANA Luigi |
| Keywords |
Betweenness, Proximity, Representation, Tree |
| Topics |
Distances, Graphs, Orders and preorders, Trees |
| Abstract |
On a family of sets, a ternary relation may be defined by stating that, for U, V, W members of the family, V is «between» U and W if and only if V includes the intersection of U and W . The relation is called «intersection-betweenness» and may be understood as the description of proximities between objects associated with sets in the family. The problem of using a tree graph for representing such a relation is discussed. Characterisations are proven both for full tree representation (there is a
tree-betweenness identical to the given intersection-betweenness: Section 2) and for partial tree representation (there is a tree-betweenness
included in the given intersection-betweenness: Section 3). Procedures for actually finding solutions to full and partial tree representation problems are illustrated in Section 4. In Section 5 some related paradigms of modern psychometrics are mentioned, to highlight the peculiar aspects of the proposed approach. |
| Number |
185, Spring 2009 |
| Language |
 English | Read the article
| Title |
Is the evolution of jazz described by a log periodic law? |
| Author |
BRISSAUD Ivan |
| Keywords |
Fractals, Jazz, Log periodicity law, Temporal tree structure |
| Topics |
Fractal, Modelling, Music, Time Series, Trees |
| Abstract |
The evolution of different phenomena in biology, society, economy, human development. can be described by series of cycles and leaps. Many authors adjust a log periodic behavior to these chronologies. Here, we suggest applying such a model to the Jazz steps (Archaic Jazz, New Orleans, Jazz Hot, Swing.). In this case we show an acceleration of the cycles up to a critical time at the middle of the fifties (so called "Cool Jazz" epoch) before a deceleration corresponding to an increasing influence of African, South American. musics over the Jazz. We find a significant agreement between the model and the data. In conclusion a question remains: is a chronology of historical evolution predictable? |
| Number |
178, Summer 2007, special issue: Art, mathematics, language and emotion |
| Language |
French | Read the article
| Title |
Computational semantics in type theory |
| Author |
RANTA Aarne |
| Keywords |
Logical semantics, Montague grammar, Type theory |
| Topics |
Computing, Linguistics, Logic, Semantics, Trees, Type Theory |
| Abstract |
This paper aims to show how Montague-style grammars can be completely formalized and thereby declaratively implemented by using the Grammatical Framework GF. The implementation covers the fundamental operations of Montague's PTQ model: the construction of analysis trees, the linearization of trees into strings, and the interpretation of trees as logical formulas. Moreover, a parsing algorithm is derived from the grammar. Given that GF is a constructive type theory with dependent types, the technique extends from explain anaphoric reference. On the other hand, GF has a built-in compositionality requirement that is stronger than in PTQ and prevents us from formulating quantifying-in rules of Montague style. This leads us to alternative formulations of such rules in terms of combinators and discontinuous constituents. The PTQ fragment will moreover be presented as an example of how a GF grammar is modified by replacing English with another target language, French. The paper concludes by a discussion of the complementary rôles of logically and linguistically oriented syntax. |
| Number |
165, Spring 2004, special issue: Constructive type theory |
| Language |
English | Read the article
| Title |
Proof Theory of Martin-Löf Type Theory. An overview |
| Author |
SETZER Anton |
| Keywords |
Generic programming, Inductive-recursive definitions, Kleene's O, Kripke Platek set theory, Mahlo universe, Martin-Löf type theory, Set theory, Well-founded trees |
| Topics |
Logic, Orders and preorders, Sets, Trees, Type Theory |
| Abstract |
We give an overview over the historic development of proof theory and the main techniques used in ordinal theoretic proof theory. We argue, that in a revised Hilbert's program, ordinal theoretic proof theory has to be supplemented by a second step, namely the development of strong equiconsistent constructive theories. Then we show, how, as part of such a programe, the proof theoretic analysis of Martin-Löf type theory with W-type and one microscopic universe containing only two finite sets is carried out. Then we look at the analysis Martin-Löf type theory with W-type and a universe closed under the W-type, and consider the extension of type theory by one Mahlo universe and its proof-theoretic analysis. Finally, we repeat the concept of inductive-recursive definitions, which extends the notion of inductive definitions substantially. We introduce a closed formalization, which can be used in generic programming, and explain, what is known about its strength. |
| Number |
165, Spring 2004, special issue: Constructive type theory |
| Language |
English | Read the article
Users rights :
The entire journal is licensed under a Creative Commons license
|
