Pages that link to "Item:Q2576438"

The following pages link to Feature selection for consistent biclustering via fractional 0-1 programming (Q2576438):

Displaying 17 items.

• A practical nonlinear dynamic framework for solving a class of fractional programming problems (Q330727) (← links)
• Finding checkerboard patterns via fractional 0-1 programming (Q604870) (← links)
• Optimization and data mining in medicine (Q845564) (← links)
• Stochastic local search for the FEATURE SET problem, with applications to microarray data (Q865564) (← links)
• A network flow model for biclustering via optimal re-ordering of data matrices (Q989888) (← links)
• A survey of data mining techniques applied to agriculture (Q1032611) (← links)
• Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
• A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems (Q1694780) (← links)
• Explicit convex and concave envelopes through polyhedral subdivisions (Q1949256) (← links)
• Solving a class of feature selection problems via fractional 0--1 programming (Q2241181) (← links)
• Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations (Q2274883) (← links)
• A global optimization algorithm for solving the minimum multiple ratio spanning tree problem (Q2392120) (← links)
• Biclustering in data mining (Q2475854) (← links)
• Random walk biclustering for microarray data (Q2476780) (← links)
• Biclustering via Sparse Singular Value Decomposition (Q3076038) (← links)
• The Improved Heuristic for Consistent Biclustering Problems (Q4607141) (← links)
• Demand forecasting of perishable farm products using support vector machine (Q5172464) (← links)