RAP: Framework for Mining Frequent Datalog Patterns

BLAŤÁK, Jan; Lubomír POPELÍNSKÝ and Miloslav NEPIL. RAP: Framework for Mining Frequent Datalog Patterns. In Proceedings of the first KDID workshop at ECML/PKDD 2002. Helsinki: Helsinki University of Technology, 2002, p. 85-86.

Basic information

Original name

RAP: Framework for Mining Frequent Datalog Patterns

Authors

BLAŤÁK, Jan (203 Czech Republic); Lubomír POPELÍNSKÝ (203 Czech Republic) and Miloslav NEPIL (203 Czech Republic, guarantor)

Edition

Helsinki, Proceedings of the first KDID workshop at ECML/PKDD 2002, p. 85-86, 2002

Publisher

Helsinki University of Technology

---

Other information

Language

English

Type of outcome

Proceedings paper

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

Finland

Confidentiality degree

is not subject to a state or trade secret

RIV identification code

RIV/00216224:14330/02:00006519

Organization unit

Faculty of Informatics

Keywords in English

inductive queries; frequent patterns

Tags

frequent patterns, inductive queries

---

Abstract

In the original language

We describe a new any-time algorithm RAP for finding maximal frequent patterns in first-order logic.

---

Links

MSM 143300003, plan (intention)

Name: Interakce člověka s počítačem, dialogové systémy a asistivní technologie Investor: Ministry of Education, Youth and Sports of the CR, Human-computer interaction, dialog systems and assistive technologies