Code Directory
 Visual Basic & VB.NET
New Code
.Net VCL for Delphi
ASP. NET C# PDF Software 4.5
LinqConnect Professional 4.8
CAD VCL: 2D/3D CAD in Delphi/C++Builder 14
wolfSSL 3.15.7
AnyStock Stock and Financial JS Charts 8.4.2
ODBC Driver for SQLite 2.4
dotConnect for SugarCRM 1.7
dbForge SQL Complete 5.9
dbForge Studio for MySQL 8.0
.Net Runtime Library for Delphi
Scimbo 1.64
AnyMap JS Maps 8.4.2
GetOrgChart 2.5.3
Top Code
PDF Focus .Net 4.0.1
Ticket Booking System 1.0
Network-Integrated Multimedia Middleware 2.2.0
Simple Webinterface Shopsystem for Shopping Carts 0.4
College Management System Script 1.0.4
Zip Zag 1.4
VisualEffectMotion Script 1.1
.NET Interop for Visual FoxPro Applications
Vapor compression cycle component models 1.0
Helpdeskphp - PHP Help Desk Software 1.0
Simple Skin segmentation 1.0
Visual FoxPro Functions/Class Libary 100
Dream Inspector 4.01
Help Desk Reloaded Free MySql PHP help desk software II.80
Top Rated
Deals and Discounts Website Script 1.0.2
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
Availability Booking Calendar PHP 1.0
PHP GZ Blog Script 1.1
ATN Jobs Software 4.0
ATN Mall 2.0
WeBuilder 2015 13.3
PHP Digital Download Script 1.0.4
A greedy algorithm for data sharpening and constraint handling 1.0
File ID: 80092

A greedy algorithm for data sharpening and constraint handling 1.0
Download A greedy algorithm for data sharpening and constraint handling 1.0http://www.mathworks.comReport Error Link
License: Freeware
File Size: 10.0 KB
Downloads: 37
Submit Rating:
A greedy algorithm for data sharpening and constraint handling 1.0 Description
Description: This function was developed for nonparametric estimation problems where the estimate must satisfy some shape constraint. Our standard example of this is using a kernel density estimator, with the constraint that the estimate can have only one mode.

Let x be the observed data, and confun(x,...) be a function that checks whether a particular constraint is satisfied. Let y0 be some initial guess solution that satisfies the constraint.

y = improve(y0,x,confun) returns in y an "improved" solution--a set of data that are closer to x than y0, and still satisfy the constraint. This idea of moving the data points to improve an estimator or to satisfy constraints is known as data sharpening.

The function uses a greedy algorithm that sweeps repeatedly through the points, moving one at a time to be closer to their target x values until no more moves can be made without violating feasibility.

Also included is the function iteratedimprove( ), which allows the user to iteratively perturb the best solution and re-run improve( ). This tends to find better solutions in difficult problems.

This code was developed for data sharpening problems in shape-constrained density estimation, but it is basically a repair method for handling constraints (a means of making infeasible solutions into feasible ones). As such it could possibly be useful for other constrained estimation problems, or for other continuous constrained optimization problems.

This is a preliminary submission. The research of which this algorithm is a part is currently in process at a statistics journal. Once the work is accepted for publication our submission will be revised and expanded with more code and more information.

License: Freeware

Related: rerun, and more, and still, closer, as such, Data, expanded, confunx, Algorithm, allows the, estimator, quotimprovedquot, made, can have, can be, checks, Code

O/S:BSD, Linux, Solaris, Mac OS X

File Size: 10.0 KB

Downloads: 37

More Similar Code

The Spherical Self-Organizing Feature Maps is a contemporary technique for data clustering and visualization.

The main advantages they offer are the following:
1. Smooth training
2. Implementation in arbitrary dimension without additional computational cost.
3. Data visualization in arbitrary dimensions

This toolbox contains a set of functions and a GUI which can be used to create glyphs from spherical...

This function contains the well known greedy algorithm for solving Set Cover problem (ChvdodAtal, 1979), with two small modifications:
* In case of more than one possible choice at a certain step, the biggest set is chosen;
* Once the...

PSB (Public Square Board) aims to be a highly customizable, user-friendly, fast and reliable discussion board package. It is written in PHP, uses a MySQL database for data storage and is licensed under the GPL.

The Data Structure & Algorithm Library (DSAL) is a library of classical data structure and algorithm.

DLL Library for data acquisition and logging, computer simulation and debugging programs.Advantages:Speedy performance: the library makes it possible to bring out into the beams of the viewing oscilloscope over a million quantization steps of...

Seasonal Kendall Trend Test for Data with and without Searial Dependance.

Tau-b seasonal: takes into account ties (and multiple observations, except, the data are preprocessed in a subfucntion and multiple observatiosn per a given...

POJava is a simple, light-weight Java-based API for data processing and development. It includes an immutable DateTime object capable of parsing free-form dates in multiple languages and formats, and a variety of utilities for data transformation.

ClinStudyWeb is designed to provide a flexible infrastructure for managing patient and assay data from clinical studies. It uses a plugin system for study-specific web forms and arbitrarily complex test classifiers, and supports XML import/export.

Cindrew is a database query rewriting tool for data exchange and data integration. It supports conjunctive inclusion dependencies (cinds), also known as GLAV mappings or source-to-target dependencies in the literature, as data integration mappings.

Iconara DOM framework is a Cocoa-framework for accessing, manipulating and outputting XML-data.

User Review for A greedy algorithm for data sharpening and constraint handling
- required fields

Please enter text on the image