Operations research and data mining

DOI10.1016/j.ejor.2006.09.023zbMath1137.90776OpenAlexW2110673691MaRDI QIDQ2467295

Shuning Wu, Xiao-Nan Li, Sigurdur Ólafsson

Publication date: 21 January 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.09.023

zbMATH Keywords

classificationoptimizationheuristicsclusteringmathematical programmingdata mining

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Management decision making, including multiple objectives (90B50) Mathematical programming (90C99)

Related Items (31)

Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach ⋮ CUSTOMER SEGMENTATION AND CLASSIFICATION FROM BLOGS BY USING DATA MINING: AN EXAMPLE OF VOIP PHONE ⋮ Effective Active Learning Strategies for the Use of Large-Margin Classifiers in Semantic Annotation: An Optimal Parameter Discovery Perspective ⋮ Optimal randomized classification trees ⋮ Profiling effects in industrial data mining by non-parametric DOE methods: an application on screening checkweighing systems in packaging operations ⋮ Synergies between operations research and data mining: the emerging use of multi-objective approaches ⋮ A framework for configuring collaborative filtering-based recommendations derived from purchase data ⋮ On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps ⋮ Walrasian equilibria from an optimization perspective: A guide to the literature ⋮ Pattern mining‐based pruning strategies in stochastic local searches for scheduling problems ⋮ On mathematical optimization for clustering categories in contingency tables ⋮ Mining twitter lists to extract brand-related associative information for celebrity endorsement ⋮ Multicriteria variable selection for classification of production batches ⋮ Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches ⋮ Catch me if you scan: data-driven prescriptive modeling for smart store environments ⋮ Visualizing data as objects by DC (difference of convex) optimization ⋮ Matrix completion under interval uncertainty ⋮ Metaheuristics for data mining ⋮ Real-time fuzzy regression analysis: a convex hull approach ⋮ An incremental nested partition method for data clustering ⋮ Synergies of operations research and data mining ⋮ A discrete particle swarm optimization method for feature selection in binary classification problems ⋮ Partner selection in virtual enterprises: a multi-criteria decision support approach ⋮ Optimization problems for machine learning: a survey ⋮ Selective linearization for multi-block statistical learning ⋮ Credit risk evaluation using multi-criteria optimization classifier with kernel, fuzzification and penalty factors ⋮ Data preparation using data quality matrices for classification mining ⋮ Sparsity in optimal randomized classification trees ⋮ New variants of pairwise classification ⋮ A reference model for customer-centric data mining with support vector machines ⋮ Potential sales estimates of a new store

Uses Software

• DistAl
• Tabu search
• C4.5
• clusfind

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• The EM algorithm for graphical association models with missing data
• Application of the cross-entropy method to clustering and vector quantization
• Discovering dispatching rules using data mining
• Optimal partitions
• A Bayesian method for the induction of probabilistic networks from data
• Multicategory classification by support vector machines
• Misclassification minimization
• Modern multidimensional scaling: theory and applications
• \(w\)-efficient partitions and the solution of the sequential clustering problem
• Bayesian network classifiers
• \(k\)-plane clustering
• Discovering interesting patterns for investment decision making with GLOWER -- a genetic learner overlaid with entropy reduction
• Learning Bayesian networks: The combination of knowledge and statistical data
• Support-vector networks
• Bayesian network classifiers versus selective \(k\)-NN classifier
• A divide-and-conquer local search heuristic for data visualization
• Optimization-based feature selection with adaptive instance sampling
• Diversification for better classification trees
• A MINSAT Approach for Learning in Logic Domains
• A Genetic Algorithm-Based Approach for Building Accurate Decision Trees
• Oblique Multicategory Decision Trees Using Nonlinear Programming
• Genetically Engineered Decision Trees: Population Diversity Produces Smarter Trees
• A Best Possible Heuristic for the k-Center Problem
• Finding Groups in Data
• A Branch and Bound Algorithm for Feature Subset Selection
• Feature Selection via Mathematical Programming
• Nested Partitions Method for Global Optimization
• Customer lifetime value: stochastic optimization approach
• Mathematical Programming for Data Mining: Formulations and Challenges
• Integer Programming and the Theory of Grouping
• Linear and Nonlinear Separation of Patterns by Linear Programming
• Cluster Analysis and Mathematical Programming
• Handbook of metaheuristics
• Mining optimized support rules for numeric attributes

This page was built for publication: Operations research and data mining