{"id":{"repo_id":"usf","oai_identifier":"oai:digitalcommons.usf.edu:etd-2043"},"canonical_url":"https://search.ndltd.org/etd/usf/oai:digitalcommons.usf.edu:etd-2043","repository":{"repo_id":"usf","name":"University of South Florida","base_url":"https://digitalcommons.usf.edu/do/oai/"},"display":{"title":"Important Extrema of Time Series: Theory and Applications","abstract":"We describe techniques for fast compression of time series and hierarchical indexing of compressed series based on the assignment of importance levels to the extrema of time series and their derivatives. We formalize the distance functions used in compression and retrieval techniques. We describe retrieval techinques that use the developed compression and indexing techniques for fast retreval of series from a database that match a given pattern.","abstract_html":"We describe techniques for fast compression of time series and hierarchical indexing of compressed series based on the assignment of importance levels to the extrema of time series and their derivatives. We formalize the distance functions used in compression and retrieval techniques. We describe retrieval techinques that use the developed compression and indexing techniques for fast retreval of series from a database that match a given pattern.","abstract_has_math":false,"creators":["Gandhi, Harith Suman"],"institution":"University of South Florida","degree_name":null,"degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Eugene Fink, Ph.D.","Dmitry Goldgof, Ph.D.","Sudeep Sarkar, Ph.D."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2004,"date_issued":"2004-03-23T08:00:00Z","date_published":"2004-03-23T08:00:00Z","updated_at":"2026-11-19T08:39:27Z","subjects":["minima","maxima","indexing trees","derivative series","distance","American Studies","Arts and Humanities"],"languages":["EN-US"],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.usf.edu/etd/1044","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.usf.edu/etd/1044","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.usf.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.usf.edu%3Aetd-2043","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Eugene Fink, Ph.D.","Dmitry Goldgof, Ph.D.","Sudeep Sarkar, Ph.D."]},{"key":"dc:creator","label":"Author","values":["Gandhi, Harith Suman"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2004-03-23T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis","M.S.C.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of South Florida"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["minima","maxima","indexing trees","derivative series","distance","American Studies","Arts and Humanities"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["EN-US"]},{"key":"dc:rights.license","label":"Dc Rights License","values":["default"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.usf.edu/etd/1044"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["We describe techniques for fast compression of time series and hierarchical indexing of compressed series based on the assignment of importance levels to the extrema of time series and their derivatives. We formalize the distance functions used in compression and retrieval techniques. We describe retrieval techinques that use the developed compression and indexing techniques for fast retreval of series from a database that match a given pattern."]},{"key":"dc:title","label":"Title","values":["Important Extrema of Time Series: Theory and Applications"]}]}],"canonical_facts":{"dc:contributor":["Eugene Fink, Ph.D.","Dmitry Goldgof, Ph.D.","Sudeep Sarkar, Ph.D."],"dc:creator":["Gandhi, Harith Suman"],"dc:date":["2004-03-23T08:00:00Z"],"dc:description":["We describe techniques for fast compression of time series and hierarchical indexing of compressed series based on the assignment of importance levels to the extrema of time series and their derivatives. We formalize the distance functions used in compression and retrieval techniques. We describe retrieval techinques that use the developed compression and indexing techniques for fast retreval of series from a database that match a given pattern."],"dc:identifier":["https://digitalcommons.usf.edu/etd/1044"],"dc:language":["EN-US"],"dc:rights.license":["default"],"dc:subject":["minima","maxima","indexing trees","derivative series","distance","American Studies","Arts and Humanities"],"dc:title":["Important Extrema of Time Series: Theory and Applications"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis","M.S.C.S."],"thesis:institution_name":["University of South Florida"]},"updated_at":"2026-11-19T08:39:27Z"}