This paper describes experiments on cleaning web corpora. While previously described approaches focus mainly on the visual representation of web pages, we evaluate approaches that rely on content and structure. We have evaluated a heuristics-based approach, as well as approaches based on decision trees, a genetic algorithm and language models. The best performance was achieved using the heurist...

In this chapter, we review a few important concepts from Grid computing related to scheduling problems and their resolution using heuristic and meta-heuristic approaches. Scheduling problems are at the heart of any Grid-like computational system. Different types of scheduling based on different criteria, such as static vs. dynamic environment, multi-objectivity, adaptivity, etc., are identified...

Purpose The paper addresses the following research question: how do decision-makers use heuristics in their international business (IB) environment? Whereas, literature has focused on entrepreneurial companies, here contrasting approaches to learning and using marketing (IM) decisions are examined discussed. Design/methodology/approach aims address a gap study of micro-foundations international...

Among the variety of heuristics evaluation methods available, four paramount approaches have emerged: Nielsen's ten usability heuristics (1994), Shneiderman's Eight Golden Rules of Interface Design (1998), Tognazzini's First Principles of Interaction Design (2003), and a set of principles based on Edward Tufte's visual display work (UW Computing & Communications, 1999). To simplify access to a ...

The present study focuses on an exploration and identification of design heuristics used in the ideation process in both industrial designers and engineering designers. Design heuristics are cognitive strategies that help the designer generate novel design concepts. These cognitive heuristics may differ based on the design problem, the context defined, and designers’ preferences. In a think-alo...

To handle a large amount of unlabeled data, batch active learning (BAL) queries humans for the labels most valuable data points at every round. Most current BAL strategies are based on human-designed heuristics, such as uncertainty sampling or mutual information maximization. However, there exists disagreement between these heuristics and ultimate goal BAL, i.e., optimizing model's final perfor...

This paper is concerned with the hybridization of two graph coloring heuristics (Saturation Degree and Largest Degree), and their application within a hyperheuristic for exam timetabling problems. Hyper-heuristics can be seen as algorithms which intelligently select appropriate algorithms/heuristics for solving a problem. We developed a Tabu Search based hyper-heuristic to search for heuristic ...

Graphplan and heuristic state space planners such as HSP-R and UNPOP are currently two of the most effective approaches for solving classical planning problems. These approaches have hither-to been seen as largely orthogonal. In this paper, we show that the planning graph structure that Graphplan builds in polynomial time, provides a rich substrate for deriving more effective heuristics for sta...

Two influential approaches to modeling choice between risky options are algebraic models (which focus on predicting the overt decisions) and models of heuristics (which are also concerned with capturing the underlying cognitive process). Because they rest on fundamentally different assumptions and algorithms, the two approaches are usually treated as antithetical, or even incommensurable. Drawi...