Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 37171 for “"Feature"”.

  1. INFORMATION GAIN FEATURE SELECTION BASED ON FEATURE INTERACTIONS

    … of dimensionality, many effective and efficient feature-selection algorithms have been developed recently. However, most feature-selection algorithms assume independence of features; they identify relevant features mainly on their individual high correlation with the target concept. These …

    houston Repository record for INFORMATION GAIN FEATURE SELECTION BASED ON FEATURE INTERACTIONS (opens in a new tab)

  2. Detecting feature interactions and feature inconsistencies in CPL

    … confronts a major obstacle known as the feature interaction problem, which describes the situation that one feature or service is violated by another in overall system behaviour. This thesis addresses a Feature Interaction detection approach for CPL. Starting with a review of the issue of …

    ottawa-retro Repository record for Detecting feature interactions and feature inconsistencies in CPL (opens in a new tab)

  3. Feature Identification

    … for identifying time periods of interest (features) in a wide range of data sets. The gamma method is a computationally inexpensive, flexible feature identification method which uses a comparison of time series to identify a rank-ordered set of features in geophysically-sourced data sets. …

    waterloo Repository record for Feature Identification (opens in a new tab)

  4. Restricting Supervised Learning: Feature Selection and Feature Space Partition

    … to solve either because of the redundant features or because of the structural complexity of the generative function. Redundant features increase the learning noise and therefore decrease the prediction performance. Additionally, a number of problems in various applications such as …

    mississippi Repository record for Restricting Supervised Learning: Feature Selection and Feature Space Partition (opens in a new tab)

  5. SPEech Feature Toolbox (SPEFT) Design and Emotional Speech Feature Extraction

    This research focuses on designing the SPEech Feature Toolbox (SPEFT), a toolbox which integrates a large number of speech features into one graphic interface in the MATLAB environment. The toolbox is designed with a Graphical User Interface (GUI) interface which makes it easy to operate; it also …

    marquette Repository record for SPEech Feature Toolbox (SPEFT) Design and Emotional Speech Feature Extraction (opens in a new tab)

  6. Feature Selection From Large Acoustic Feature Sets in Computational Paralinguistics

    … employ datasets with ever increasing number of features. Using large feature sets has helped improve recognition performances. However, processing these large sets has given rise to various problems. Feature selection methods, which reduce the dimensionality of the original feature sets by …

    cuny-grad Repository record for Feature Selection From Large Acoustic Feature Sets in Computational Paralinguistics (opens in a new tab)

  7. Understanding feature modularity

    Features are increments in program functionality. Feature abstraction, the process of abstracting programs into their constituent features, is a relatively common yet informal practice in software design. It is common because it simplifies program understanding. It is also important for software …

    texas Repository record for Understanding feature modularity (opens in a new tab)

  8. Feature Model Mining

    … instances and its language specification. Feature model mining addresses these issues by synthesizing a representative model bottom-up from a sample set of instances called configurations.</p> <p>This thesis presents a mining algorithm that reverse-engineers a probabilistic feature model …

    waterloo Repository record for Feature Model Mining (opens in a new tab)

  9. Feature Model Synthesis

    … for users that configure the software. Feature models provide a centralized source for describing the variability in a software system. A feature model consists of a hierarchy of features—the common and variable system characteristics—with constraints between features. Constructing a …

    waterloo Repository record for Feature Model Synthesis (opens in a new tab)

  10. Significant Feature Clustering

    … clustering algorithm we call <em>Significance Feature Clustering</em>, which is designed to cluster text documents. Its central premise is the mapping of raw frequency count vectors to discrete-valued significance vectors which contain values of -1, 0, or 1. These values represent whether a …

    waterloo Repository record for Significant Feature Clustering (opens in a new tab)

  11. Newspaper Feature Syndicates

    … give as completely as possible a survey of the Feature Syndicate Field in the United States, the events which led in the establishment of this branch of service for newspapers, and the results which such establishment have produced in the newspaper world. The modern Newspaper is not complete …

    marquette Repository record for Newspaper Feature Syndicates (opens in a new tab)

  12. Visual Feature Learning

    … system heavily relies on the quality of features, by which data are represented. The prior arts of feature extraction can be concluded in different levels, which, in a bottom up order, are low level features (e.g., pixels and gradients) and middle/high-level features (e.g., the BoW model …

    whiterose Download PDF for Visual Feature Learning (opens in a new tab)

  13. Weighted Feature Classification

    … classification algorithms either consider all features as equally important (equal weights), or do not analyze consistency of weights assigned to features. When features are not equally important, assigning consistent weights is a not obvious task. In general we have two cases. The first case …

    mcmaster Repository record for Weighted Feature Classification (opens in a new tab)

  14. Kaizen Programming with Enhanced Feature Discovery: An Automated Approach to Feature Selection and Feature Discovery for Prediction Models

    Feature selection (FS) is the process of finding an ideal set of features for a prediction model from a set of candidate features. A key step in designing a prediction model is reducing the size of the input feature set while increasing its usefulness. This reduces the complexity of a model, making …

    rit Repository record for Kaizen Programming with Enhanced Feature Discovery: An Automated Approach to Feature Selection and Feature Discovery for Prediction Models (opens in a new tab)

  15. Classification of twitter trends using feature ranking and forward feature selection

    … classifying Twitter trends by adding a layer of feature selection and feature ranking. A variety of feature ranking algorithms, such as TF-IDF and bag-of-words, are used to facilitate the feature selection process. This helps in surfacing the important features, while reducing the feature space …

    missouri Repository record for Classification of twitter trends using feature ranking and forward feature selection (opens in a new tab)

  16. A Mode-Based Pattern for Feature Requirements, and a Generic Feature Interface

    Feature-oriented requirements decompose a system's requirements into individual bundles of functionality called features, where each feature's behaviour can be expressed as a state-machine model. However, state machines are difficult to write; determining how to decompose behaviour into states is …

    waterloo Repository record for A Mode-Based Pattern for Feature Requirements, and a Generic Feature Interface (opens in a new tab)

Page 1 of 1859