A guideline for choosing parameters of multivariate loss functions

Date

2016-07-03

Author

Köksal, Gülser

Metadata

Show full item record

Item Usage Stats

49
views

0
downloads

URI

https://hdl.handle.net/11511/77224

Collections

Unverified, Conference / Seminar

Suggestions

OpenMETU
Core

A rule-based method for object segmentation in video sequences Alatan, Abdullah Aydın; Onural, L (1997-01-01) Object segmentation and tracking are problems within the scope of MPEG-4 and MPEG-7 standardization activities. A novel algorithm for both object segmentation and tracking is presented. The algorithm fuses motion, color, and accumulated previous segmentation data at 'region level', in contrast to conventional 'pixel level' approaches. The information fusion is achieved by a rule-based region processing unit which intelligently utilizes the motion information to locate the objects in the scene, the color inf...
A METHOD FOR COMPARATIVE-EVALUATION OF EIT ALGORITHMS USING A STANDARD DATA SET IDER, YZ; EYUBOGLU, BM; KUZUOGLU, M; Leblebicioğlu, Mehmet Kemal; BAYSAL, U; CAGLAR, BK; BIRGUL, O (IOP Publishing, 1995-08-01) The point spread function (PSF) is the most widely used tool for quantifying the spatial resolution of imaging systems. However, prerequisites for the proper use of this tool are linearity and space invariance. Because EIT is non-linear it is only possible to compare different reconstruction algorithms using a standard data set. In this study, the FEM is used to generate simulation data, which are used to investigate the non-linear behaviour of EIT, the space dependence of its PSF and its capability of reso...
A Comparison Method For Association Rule Mining Algorithms Azadıamın, Sanam; Köksal, Gülser (null; 2016-11-15)
A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems Chung, Chia-Shin; Flynn, James; Kırca, Ömer (Elsevier BV, 2006-10-01) The m-machine permutation flowshop problem with the total tardiness objective is a common scheduling problem, which is known to be NP-hard. Here, we develop a branch and bound algorithm to solve this problem. Our algorithm incorporates a machine-based lower bound and a dominance test for pruning nodes. We undertake a numerical study that evaluates our algorithm and compares it with the best alternative existing algorithm. Extensive computational experiments indicate that our algorithm performs better and ca...
A one-pass predictor-corrector algorithm for the inverse Langevin function BAŞDEMİR, SELÇUK; Dal, Hüsnü (2022-01-01) © The Author(s) 2022.Inverse Langevin function has an extensive use in statistical mechanics, polymer chemistry, and physics. Main struggle is that the inverse Langevin function cannot be expressed in an exact analytical form. To this end, many approaches to estimate the inverse Langevin function have been proposed. A trade-off can be observed between level of accuracy and mathematical complexity in the existing approximants in the literature. In the present contribution, a simple, yet efficient one-pass pr...

Citation Formats

G. Köksal, “A guideline for choosing parameters of multivariate loss functions,” 2016, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/77224.