Relevance feedback and sparsity handling methods for temporal data

Simple item page
buir.advisorUlusoy, Özgür
dc.contributor.authorEravcı, Bahaeddin
dc.date.accessioned2018-08-09T06:19:16Z
dc.date.available2018-08-09T06:19:16Z
dc.date.copyright2018-07
dc.date.issued2018-07
dc.date.submitted2018-08-07
dc.departmentDepartment of Computer Engineeringen_US
dc.descriptionCataloged from PDF version of article.en_US
dc.descriptionThesis (Ph.D.): Bilkent University, Department of Communication and Design, İhsan Doğramacı Bilkent University, 2018.en_US
dc.descriptionIncludes bibliographical references (leaves 84-92).en_US
dc.description.abstractData with temporal ordering arises in many natural and digital processes with an increasing importance and immense number of applications. This study provides solutions to data mining problems in analyzing time series both in standalone and sparse networked cases. We initially develop a methodology for browsing time series repositories by forming new time series queries based on user annotations. The result set for each query is formed using diverse selection methods to increase the effectiveness of the relevance feedback (RF) mechanism. In addition to RF, a unique aspect of time series data is considered and representation feedback methods are proposed to converge to the outperforming representation type among various transformations based on user annotations as opposed to manual selection. These methods are based on partitioning of the result set according to representation performance and a weighting approach which amplifies different features from multiple representations. We subsequently propose the utilization of autoencoders to summarize the time series into a data-aware sparse representation to both decrease computation load and increase the accuracy. Experiments on a large variety of real data sets prove that the proposed methods improve the accuracy significantly and data-aware representations have recorded similar performances while reducing the data and computational load. As a more demanding case, the time series dataset may be incomplete needing interpolation approaches to apply data mining techniques. In this regard, we analyze a sparse time series data with an underlying time varying network. We develop a methodology to generate a road network time series dataset using noisy and sparse vehicle trajectories and evaluate the result using time varying shortest path solutions.en_US
dc.description.degreePh.D.en_US
dc.description.provenanceSubmitted by Betül Özen (ozen@bilkent.edu.tr) on 2018-08-09T06:19:16Z No. of bitstreams: 1 Bahaeddin_ERAVCI_PHD_thesis.pdf: 6280761 bytes, checksum: cc597acdd845af6bd71ce5016b64a599 (MD5)en
dc.description.provenanceMade available in DSpace on 2018-08-09T06:19:16Z (GMT). No. of bitstreams: 1 Bahaeddin_ERAVCI_PHD_thesis.pdf: 6280761 bytes, checksum: cc597acdd845af6bd71ce5016b64a599 (MD5) Previous issue date: 2018-08en
dc.description.statementofresponsibilityby Bahaeddin Eravcı.en_US
dc.format.extentxi, 96 leaves : charts (some color) ; 30 cm.en_US
dc.identifier.itemidB158759
dc.identifier.urihttp://hdl.handle.net/11693/47732
dc.language.isoEnglishen_US
dc.publisherBilkent Universityen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectTime Seriesen_US
dc.subjectRelevance Feedback, Diversityen_US
dc.subjectAutoencoderen_US
dc.subjectSparsityen_US
dc.subjectTime-Varying Graphsen_US
dc.titleRelevance feedback and sparsity handling methods for temporal dataen_US
dc.title.alternativeZamansal veriler için ilgililik geri bildirimi ve seyreklik ele alma metotlarıen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Bahaeddin_ERAVCI_PHD_thesis.pdf
Size:
5.99 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Dept. of Computer Engineering - Ph.D. / Sc.D.