Formal concept analysis : 14th International Conference, ICFCA 2017, Rennes, France, June 13-16, 2017, proceedings
著者
書誌事項
Formal concept analysis : 14th International Conference, ICFCA 2017, Rennes, France, June 13-16, 2017, proceedings
(Lecture notes in computer science, 10308. Lecture notes in artificial intelligence)
Springer, c2017
- : pbk.
- タイトル別名
-
ST:ICFCA 2017
大学図書館所蔵 全1件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Other editors: , Daniel Borchmann, Peggy Cellier, Sébastien Ferré
Includes bibliographical references and index
"LNCS sublibrary : SL7 Artificial intelligence"--T.p. verso
内容説明・目次
内容説明
This book constitutes the proceedings of the 14th International Conference on Formal Concept Analysis, ICFCA 2017, held in Rennes, France, in June 2017.
The 13 full papers presented in this volume were carefully reviewed and selected from 37 submissions. The book also contains an invited contribution and a historical paper translated from German and originally published in "Die Klassifkation und ihr Umfeld", edited by P. O. Degens, H. J. Hermes, and O. Opitz, Indeks-Verlag, Frankfurt, 1986.
The field of Formal Concept Analysis (FCA) originated in the 1980s in Darmstadt as a subfield of mathematical order theory, with prior developments in other research groups. Its original motivation was to consider complete lattices as lattices of concepts, drawing motivation from philosophy and mathematics alike. FCA has since then developed into a wide research area with applications much beyond its original motivation, for example in logic, data mining, learning, and psychology.
目次
Invited Contribution.- An Invitation to Knowledge Space Theory.- Historical Paper.- Implications and Dependencies between Attributes.- Regular Contributions.- The implication logic of (n,k)-extremal lattices.- Making use of empty intersections to improve the performance of CbO-type algorithms.- On the Usability of Probably Approximately Correct Implication Bases. -Formal Concept Analysis in a Logical Programming Setting for Visualization Oriented (Power) Graph Compression.- A Proposition for Sequence Mining Using Pattern Structures. -An investigation of user behavior in educational platforms using Temporal Concept Analysis. -Hierarchies of Weighted Closed Partially-Ordered Patterns for Enhancing Sequential Data Analysis.- First Notes on Maximum Entropy Entailment for Quantified Implications. - On overfitting of classifiers making a lattice.- Learning Thresholds in Formal Concept Analysis.- The Linear Algebra in Extended Formal Concept Analysis over Idempotent Semifields.- Distributed and Parallel Computation of the Canonical Direct Basis.
「Nielsen BookData」 より