Society for Industrial and Applied Mathematics

Displaying 1-7 of 7 results

  • White Papers // Jun 2010

    Formal Theory of Noisy Sensor Network Localization

    Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs between which the distance is known, a significant result in the theory of range-based sensor network localization is that if the graph underlying the...

    Provided By Society for Industrial and Applied Mathematics

  • White Papers // Feb 2010

    Efficiently Mining Closed Subsequences With Gap Constraints

    Mining frequent subsequence patterns from sequence databases is a typical data mining problem and various efficient sequential pattern mining algorithms have been proposed. In many problem domains (e.g, biology), the frequent subsequences confined by the predefined gap requirements are more meaningful than the general sequential patterns. In this paper one...

    Provided By Society for Industrial and Applied Mathematics

  • White Papers // Jul 2009

    Shared State for Client-Server Mining

    For many organizations the explosive growth in data collection techniques and database technology has resulted in large and dynamically growing datasets. These organizations are increasingly turning to data mining, the process of extracting useful information from such datasets. These datasets are typically in a remote repository accessible via a local...

    Provided By Society for Industrial and Applied Mathematics

  • White Papers // May 2009

    The Scientific Data Mining Process

    The author described various ways in which data mining was being applied to science and engineering problems. The author identified common themes across these diverse applications. In this chapter the author use these themes to describe an end-to-end data mining process, including various tasks at each step of the process...

    Provided By Society for Industrial and Applied Mathematics

  • White Papers // Apr 2009

    Optimal Performance of Networked Control Systems With Nonclassical Information Structures

    A discrete time stochastic feedback control system consisting of a nonlinear plant, a sensor, a controller, and a noisy communication channel between the sensor and the controller is considered. The sensor has limited memory and, at each time, it transmits an encoded symbol over the channel and updates its memory....

    Provided By Society for Industrial and Applied Mathematics

  • White Papers // Feb 2009

    A Hybrid Data Mining Metaheuristic for the p-Median Problem

    Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for which the use of exact methods is impractical. In this work, one proposes a hybrid version of the GRASP metaheuristic, which incorporates a data mining process, to solve the p-median problem. The paper believes that...

    Provided By Society for Industrial and Applied Mathematics

  • White Papers // Feb 2009

    High Performance Parallel/Distributed Biclustering Using Barycenter Heuristic

    Biclustering refers to simultaneous clustering of objects and their features. Use of biclustering is gaining momentum in areas such as text mining, gene expression analysis and collaborative filtering. Due to requirements for high performance in large scale data processing applications such as Collaborative filtering in E-commerce systems and large scale...

    Provided By Society for Industrial and Applied Mathematics

  • White Papers // Feb 2009

    A Hybrid Data Mining Metaheuristic for the p-Median Problem

    Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for which the use of exact methods is impractical. In this work, one proposes a hybrid version of the GRASP metaheuristic, which incorporates a data mining process, to solve the p-median problem. The paper believes that...

    Provided By Society for Industrial and Applied Mathematics

  • White Papers // Feb 2009

    High Performance Parallel/Distributed Biclustering Using Barycenter Heuristic

    Biclustering refers to simultaneous clustering of objects and their features. Use of biclustering is gaining momentum in areas such as text mining, gene expression analysis and collaborative filtering. Due to requirements for high performance in large scale data processing applications such as Collaborative filtering in E-commerce systems and large scale...

    Provided By Society for Industrial and Applied Mathematics

  • White Papers // Feb 2010

    Efficiently Mining Closed Subsequences With Gap Constraints

    Mining frequent subsequence patterns from sequence databases is a typical data mining problem and various efficient sequential pattern mining algorithms have been proposed. In many problem domains (e.g, biology), the frequent subsequences confined by the predefined gap requirements are more meaningful than the general sequential patterns. In this paper one...

    Provided By Society for Industrial and Applied Mathematics

  • White Papers // Jul 2009

    Shared State for Client-Server Mining

    For many organizations the explosive growth in data collection techniques and database technology has resulted in large and dynamically growing datasets. These organizations are increasingly turning to data mining, the process of extracting useful information from such datasets. These datasets are typically in a remote repository accessible via a local...

    Provided By Society for Industrial and Applied Mathematics

  • White Papers // May 2009

    The Scientific Data Mining Process

    The author described various ways in which data mining was being applied to science and engineering problems. The author identified common themes across these diverse applications. In this chapter the author use these themes to describe an end-to-end data mining process, including various tasks at each step of the process...

    Provided By Society for Industrial and Applied Mathematics

  • White Papers // Apr 2009

    Optimal Performance of Networked Control Systems With Nonclassical Information Structures

    A discrete time stochastic feedback control system consisting of a nonlinear plant, a sensor, a controller, and a noisy communication channel between the sensor and the controller is considered. The sensor has limited memory and, at each time, it transmits an encoded symbol over the channel and updates its memory....

    Provided By Society for Industrial and Applied Mathematics

  • White Papers // Jun 2010

    Formal Theory of Noisy Sensor Network Localization

    Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs between which the distance is known, a significant result in the theory of range-based sensor network localization is that if the graph underlying the...

    Provided By Society for Industrial and Applied Mathematics