OpenAlex
PricingAboutJobs
Log inGet started
Work

Efficient θ-subsumption based on graph algorithms

HTML

Year: 1997
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Inductive Logic Programming: 6th International Workshop, ILP-96 Stockholm, Sweden, August 26–28, 1996 Selected Papers
DOI: 10.1007/3-540-63494-0_57
Authors: Tobias Scheffer, Ralf Herbrich, Fritz Wysotzki
Institution: Technische Universität Berlin
Language: English

Topic: Data Mining Algorithms and Applications
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Keywords: inductive logic programming, clique search, graph algorithms, pruning techniques, search space reduction, mesh design

Open Access status: closed
OpenAlex ID: W1548156140
FWCI: 1.043
Cites: 25
Cited by: 40
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security