Weighted model selection for time series

Date

2017-05-26

Author

Akça, Elif
Yozgatlıgil, Ceylan

Metadata

Show full item record

Item Usage Stats

31
views

0
downloads

URI

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

Collections

Unverified, Conference / Seminar

Suggestions

OpenMETU
Core

Weighted multi-visibility analysis on directional paths Şeker, Çağıl; Toprak, Vedat; Department of Geodetic and Geographical Information Technologies (2010) Visibility analysis is an important GIS tool that is used in a diverse array of disciplines ranging from earth sciences to telecommunications. Multi-visibility, as a cumulative type of visibility, combines many point-to-point results into a multi-value array. Points, lines, or areas can be used as sources or targets; and the combined values can be calculated in both ways. Through multi-visibility, a special 2.5D visibility value surface can be constructed over a digital elevation model. The effectiveness of...
Weighted k-Nearest Neighbor Adaptations to Spare Part Prediction Business Scenario at SAP System Esgin, Eren (SCITEPRESS; 2020-2-24) In the context of intelligent maintenance, spare part prediction business scenario seeks promising return-on-investment (ROI) by radically diminishing the hidden costs at after-sales customer services. However, the classification of class-imbalanced data with mixed type features at this business scenario is not straightforward. This paper proposes a hybrid classification model that combines C4.5, Apriori algorithms and weighted k-Nearest Neighbor (kNN) adaptations to overcome potential shortcomings observed...
Weighted Matrix Reordering and Parallel Banded Preconditioners for Iterative Linear System Solvers Manguoğlu, Murat; Ahmed, Sameh; Ananth, Grama (2010-01-01)
WEIGHTED MATRIX ORDERING AND PARALLEL BANDED PRECONDITIONERS FOR ITERATIVE LINEAR SYSTEM SOLVERS Manguoğlu, Murat; Sameh, Ahmed H.; Grama, Ananth (Society for Industrial & Applied Mathematics (SIAM), 2010-01-01) The emergence of multicore architectures and highly scalable platforms motivates the development of novel algorithms and techniques that emphasize concurrency and are tolerant of deep memory hierarchies, as opposed to minimizing raw FLOP counts. While direct solvers are reliable, they are often slow and memory-intensive for large problems. Iterative solvers, on the other hand, are more efficient but, in the absence of robust preconditioners, lack reliability. While preconditioners based on incomplete factor...
Weighted shapes for embedding perceived wholes Keles, Hacer Yalim; Özkar Kabakçıoğlu, Mine; Tarı, Zehra Sibel (2012-01-01) Embedding parts is a key problem in computing when dealing with continuous matter such as shapes rather than discrete matter such as symbols. For computing part relations such as embedding, a technical framework that uses weighted shapes is introduced and implemented. In the proposed framework, for any given two-dimensional shape, the entire canvas is defined as a weighted shape and serves as a registration mark in detecting embedded parts. The approach treats shapes as perceived wholes rather than composed...

Citation Formats

E. Akça and C. Yozgatlıgil, “Weighted model selection for time series,” 2017, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/85615.