Документ взят из кэша поисковой машины. Адрес оригинального документа : http://lib.mexmat.ru/books/8851
Дата изменения: Unknown
Дата индексирования: Sun Apr 10 04:24:36 2016
Кодировка: Windows-1251

Поисковые слова: trees
Barthelemy J.-P., Guenoche A. - <b style="color:black;background-color:#ffff66">Trees</b> and proximity representations :: Электронная библиотека попечительского совета мехмата МГУ
 
Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Barthelemy J.-P., Guenoche A. - Trees and proximity representations
Barthelemy J.-P., Guenoche A. - Trees and proximity representations

Читать книгу
бесплатно

Скачать книгу с нашего сайта нельзя

Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Trees and proximity representations

Авторы: Barthelemy J.-P., Guenoche A.

Аннотация:

Barthelemy and Guenoche's book is concerned precisely with the study of classification models, using discrete mathematics and combinatorics to represent, interpret and reveal the structure of the relations existing deep within families of objects; it therefore seems to lie at the heart of the problem area which has just been mentioned. We do not hesitate to insist on this point: for all those who are concerned with current developments in the domain of artificial intelligence and who wish to approach this domain scientifically, this book is connected directly or indirectly with their interests, even though they will not find here any explicit reference to Artificial Intelligence. Perhaps the authors have thereby deprived themselves of an easy publicity bandwagon.


Язык: en

Рубрика: Computer science/Дискретная математика/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 1991

Количество страниц: 238

Добавлена в каталог: 10.11.2005

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
26-relation associated with separation index      147-149
Additive constant problem      123
Additive separation      54
Additive tree distances      33 34 49 53 54 58 60 75 78-80 82 90
Additive trees      14
ADDTREE algorithm      149-151 167
Adjustment problem      98
Affine transformations      41 219
Algorithm comparison      221-226
Algorithm comparison, criteria      222-224
Analysis of 0/1 variable      217-218
Analysis of information      14
Approximation by centroid distances      89-90
Approximation by tree analysis      60-66
Approximation by tree distance      60-66
Approximation by ultrametrics      125
Approximation criterion      45
Approximation of dissimilarity of centroid distances      90
Approximation of distance index by ultrametrics      109-111
Approximation problem      45
Arbitrary distance index      98
Arbitrary separation index      147
Arboreal index      200
Archaeological data      187-188 204
Aristotelian classification      34
Arrays, acquistion of 0/1      185-187
Articulation point      58
Ascending hierarchical classification      121
Ascending hierarchical classification, algorithms      124-125
Ascending hierarchical classification, program for      104-109
Associated 2-relation      148
Asymmetric proximities      229-230
Automatic classification      13
Automatic drawing of valued trees      23
Average linkage method      104 109 120 121 123 221
Average linkage ultrametric      121
Axial drawing      25 28-31 121
Bi-directed trees      82 230
Bi-tree proximity      230
binary variables      183-187
Binary variables, tree analysis of set of      196-205
Bipartition      183
Boolean analysis      217-218
Boolean functions      185
Brothers      6
Buneman construction      78 217
Buneman construction, applications of      192-196
Buneman construction, definition      183
Buneman family      179-181 192-194 196 200 206
Buneman family and X-trees      181-183
Buneman family, definition      180
Buneman family, local characterisation      210-211
Buneman family, recognition of      196-200
Buneman graph, algorithm for      202
Buneman graph, construction of      202-205
Buneman graph, maximal cliques of      201-205
Buneman theory      171-192 216-217
Buneman theory, consequences of      217
Bunemanian      197 200 201 204
Burt array      218
Burt table      188
Centroid component      123
Centroid distances      87-90 119 121