Publication

Capturing response behavior heterogeneity in the quantification of semi-open questions: a mixed discrete-continuous approach

Michel Bierlaire
2014
Reports

Abstract

This paper presents a method to account for response behavior heterogeneity in the quantification of adjectives reported in semi-open questions. Semi-open questions are useful to capture psychological constructs such as perceptions. However, due to the qualitative nature of adjectives, it is difficult to assign an objective numerical value to them. The proposed model contributes to (1) account for response behavior heterogeneity in the evaluation of a new data type and (2) investigate the use of both discrete and continuous scales. As application example, the estimated ratings of the adjectives are integrated into a hybrid choice model of transportation mode preferences.

Official source

https://infoscience.epfl.ch/entities/publication/68ac6bf7-5a29-448f-a794-77b6c1ccd92b

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Michel Bierlaire
2014
Reports

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/68ac6bf7-5a29-448f-a794-77b6c1ccd92b

About this result

Related concepts (30)

Data type

In computer science and computer programming, a data type (or simply type) is a collection or grouping of data values, usually specified by a set of possible values, a set of allowed operations on these values, and/or a representation of these values as machine types. A data type specification in a program constrains the possible values that an expression, such as a variable or a function call, might take. On literal data, it tells the compiler or interpreter how the programmer intends to use the data.

Algebraic data type

In computer programming, especially functional programming and type theory, an algebraic data type (ADT) is a kind of composite type, i.e., a type formed by combining other types. Two common classes of algebraic types are product types (i.e., tuples and records) and sum types (i.e., tagged or disjoint unions, coproduct types or variant types). The values of a product type typically contain several values, called fields. All values of that type have the same combination of field types.

Recursive data type

In computer programming languages, a recursive data type (also known as a recursively-defined, inductively-defined or inductive data type) is a data type for values that may contain other values of the same type. Data of recursive types are usually viewed as directed graphs. An important application of recursion in computer science is in defining dynamic data structures such as Lists and Trees. Recursive data structures can dynamically grow to an arbitrarily large size in response to runtime requirements; in contrast, a static array's size requirements must be set at compile time.

Related publications (6)

Capturing response behavior heterogeneity in the quantification of semi-open questions: a mixed discrete-continuous approach

Chat with Graph Search

Automating Verification of Functional Programs with Quantified Invariants

Instant Pickles: Generating Object-Oriented Pickler Combinators for Fast and Extensible Serialization

Towards Geoservices Portals MEDIAMAPS: WGIS trends for business applications