Mixed-initiative, multi-source information assistants

Published 1 April 2001

Craig A. Knoblock, Steven Minton, José Luis Ambite, Maria Muslea, Jean Oh, Martin Frank

DOI10.1145/371920.372185

Citations45

TL;DR

The Heracles framework for building Web-based information assistants provides the infrastructure to rapidly construct new applications that extract information from multiple Web sources and interactively integrate the data using a dynamic, hierarchical constraint network.

Abstract

Article Share on Mixed-initiative, multi-source information assistants Authors: Craig A. Knoblock Univ. of Southern California Univ. of Southern CaliforniaView Profile , Steven Minton Fetch Technologies Fetch TechnologiesView Profile , José Luis Ambite Univ. of Southern California Univ. of Southern CaliforniaView Profile , Maria Muslea Univ. of Southern California Univ. of Southern CaliforniaView Profile , Jean Oh Univ. of Southern California Univ. of Southern CaliforniaView Profile , Martin Frank Univ. of Southern California Univ. of Southern CaliforniaView Profile Authors Info & Claims WWW '01: Proceedings of the 10th international conference on World Wide WebMay 2001 Pages 697–707https://doi.org/10.1145/371920.372185Online:01 April 2001Publication History 26citation438DownloadsMetricsTotal Citations26Total Downloads438Last 12 Months5Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

Keywords

Computer Science

Elsevier eBooksFoundations of Constraint Satisfaction

1,616 Citations1993

Introduction to the C SP CSP solving - an overview chapter fundamental concepts of the CSP chapter problem reduction chapter basic search strategies for solving CSPs search orders in searching in C SPs exploitation of problem specific features stochastic search methods.

Constraint satisfaction in logic programming

1,222 Citations1989Pascal Van Hentenryck

The ideas introduced in "Constraint Satisfaction in Logic Programming " have been used successfully to solve more than a dozen practical problems in operations research and circuit design, including disjunctive scheduling, warehouse location, cutting stock car sequencing, and microcode labeling problems.

National Conference on Artificial IntelligenceDynamic constraint satisfaction problems

399 Citations1990Sanjay Mittal, Brian Falkenhainer

This paper presents a language for expressing four types of activity constraints in terms of variable values and variables being considered, and describes an implemented algorithm that enables tight interaction between constraints about variable activity and constraints aboutVariable values.

Autonomous Agents and Multi-Agent SystemsHierarchical Wrapper Induction for Semistructured Information Sources

368 Citations2001Ion Muslea, Steven Minton +1 more

This work introduces an inductive algorithm, STALKER, that generates high accuracy extraction rules based on user-labeled training examples that can wrap information sources that could not be wrapped by existing inductive techniques.

Selective Sampling with Redundant Views

169 Citations2000Ion Muslea, Steven Minton +1 more

The most general algorithm in the cotesting family, naive co-testing, is analyzed, which can be used with virtually any type of learner and may also boost the classification accuracy.

Studies in fuzziness and soft computingAccurately and Reliably Extracting Data from the Web: A Machine Learning Approach

132 Citations2003Craig A. Knoblock, Kristina Lerman +2 more

A set of tools for extracting data from web sites and transforming it into a structured data format, such as XML, so that the resulting data can be used to build new applications without having to deal with unstructured data.

Constraint Propagation and Value Acquisition: Why we should do it Interactively

51 Citations1999Evelina Lamma, Paola Mello +4 more

An Interactive Constraint Satisfaction Problem (ICSP) model is introduced as extension of the widely used CSP model, which retrieves variable domain values when needed during the resolution process by means of Interactiveconstraints, which retrieve (possibly consistent) information.

Learning the Common Structure of Data

38 Citations2000Kristina Lerman, Steven Minton

An efficient algorithm is presented that learns structural information about data from positive examples alone and automatically identifies data on Web pages so that the wrapper may be reinduced when the source format changes.

RePEc: Research Papers in EconomicsSemantic integration of disparate information soruces over the Internet using constraint propagation

21 Citations1997Stéphane Bressan, Cheng Hian Goh

This paper outlines the Context Mediation abductive framework and presents the context Mediation procedure, and shows how this procedure is implemented using a constraint store and a constraint propagation model.

Combining Constraint Propagation and Backtracking for Distributed Engineering

14 Citations2002Charles Petrie, Heecheol Jeon +1 more

An agent-based approach for engineering problems in which the constraints and general control of problem solving are distributed, and responsibilities are divided between domain-specific agents, which control the overall problem solving, and generic, reusable agents.