• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Logical Analysis of Data and Knowledge Acquisition

Research Project

Project/Area Number 09044160
Research Category

Grant-in-Aid for international Scientific Research

Allocation TypeSingle-year Grants
SectionJoint Research
Research Field Intelligent informatics
Research InstitutionKYOTO UNIVESITY

Principal Investigator

IBARAKI Toshihide  Kyoto Univ., Graduate School of Informatics, Professor, 情報学研究科, 教授 (50026192)

Co-Investigator(Kenkyū-buntansha) HAMMER Peter  Rutgers University, RUTCOR,Professor, ラトコー研究所, 教授
BOROS Eudre  Rutgers University, RUTCOR,Professor, ラトコー研究所, 教授
MASUYAMA Shigeru  Toyohashi Inst.of Tech.Science, Faculty of Eng, Prof., 工学部, 教授 (60173762)
YAGIURA Mutsunori  Kyoto Univ., Graduate School of Informatics, Assis.Prof., 情報学研究科, 助手 (10263120)
NAGAMOCHI Hiroshi  Graduate School of Informations, Associate Prof., 情報学研究科, 助教授 (70202231)
EITER Thomas  ギーセン大学, 工学部, 助教授
KAMEDA Tiko  サイモンフレーザー大学, 計算科学部, 教授
Project Period (FY) 1997 – 1998
Project Status Completed (Fiscal Year 1998)
Budget Amount *help
¥8,500,000 (Direct Cost: ¥8,500,000)
Fiscal Year 1998: ¥3,900,000 (Direct Cost: ¥3,900,000)
Fiscal Year 1997: ¥4,600,000 (Direct Cost: ¥4,600,000)
KeywordsLogical Analysis of Data / Knowledge Aquisition / Data Mining / Knowldge Discovery / Booleam functions
Research Abstract

The main purpose of this research is to extract meaningful information from the data of large size, which can be found in various fields of this modern society. In particular, we are interested in the method which is called the logical analysis of data (LAD). To acquire the knowledge from the data set, LAD constructs a Boolean function consitstent with the given data, and then analyzes it from the logical point of view.
Mathmatically, a data set consists of a set of positive examples T * {O, i} ^n and a set of negative examples F * {O, 1}^n . A Boolean function f is called an extension of (T, F) if f outputs 1 (resp., 0) for every vector in T (resp., F). In this study, we clarified the conditions on (T, F) so that its extension exists in a given class of functions C.As data usually contain errors and/or incomplete bits, the concept of extensions is then generalized to cope with such situations, and the conditions for the exsistence of generalized extentions are throughly investigated.
Also, many real world data contain numerical attributes. These data can be transformed to binary data, by introducing appropriate cut points. The complexity and algorithms for the problem of minimizing the number of necessary cut points are studied and settled in this research.

Report

(3 results)
  • 1998 Annual Research Report   Final Research Report Summary
  • 1997 Annual Research Report
  • Research Products

    (10 results)

All Other

All Publications (10 results)

  • [Publications] E.Boros: "Error-free and best-fit extensions of partially defined boolean functions" Information and Computation. 140. 254-283 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] T.Eiter: "Double Horn functions" Information and Computation. 144. 155-190 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] K.Makino: "Horn extension of a partially defined Boolean function" SIAM J,on Computing. (掲載予定).

    • Related Report
      1998 Annual Research Report
  • [Publications] E.Boros: "Logical analysis of binary data with missing bits" Artificial Intelligence. (掲載予定).

    • Related Report
      1998 Annual Research Report
  • [Publications] K.Makino, T.Ibaraki: "The maximum latency and identification of positive Boolean functions" SIAM J.on Computing. 26. 1363-1383 (1997)

    • Related Report
      1997 Annual Research Report
  • [Publications] E.Boros, -P.L.Hawmer T.Ibaraki, K.Kawakami: "Polynomial time recognition of 2-monotonic positive Boolean functions given by an oracle" SIAM J.on Computing. 26. 93-109 (1997)

    • Related Report
      1997 Annual Research Report
  • [Publications] E.Boros, P.L, Hammer T.Ibaraki, A.Kogan: "Logical analysis of numerical data" Mathematical Programming. 79. 163-190 (1997)

    • Related Report
      1997 Annual Research Report
  • [Publications] T.Ibaraki, T.Kameda: "Multi-frame isochronous service for ATM networks:Stop-and-go revisited" Proc.IC3N(International Conf.on Computer Communications and Networks). 6. 22-25 (1997)

    • Related Report
      1997 Annual Research Report
  • [Publications] K.Makino, T.Ibaraki: "Inner-core and outer-core functions of partially defined Boolean functions" Discrete Applied Mathematics. (予定).

    • Related Report
      1997 Annual Research Report
  • [Publications] E.Boros, T.Ibaraki K.Makino: "Error-free and best-fit extensions of partially defined Boolean functions" Information and Computation. 140. 254-283 (1998)

    • Related Report
      1997 Annual Research Report

URL: 

Published: 1997-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi