{"id":12851,"date":"2021-11-22T18:38:12","date_gmt":"2021-11-22T23:38:12","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=12851"},"modified":"2021-11-22T18:39:07","modified_gmt":"2021-11-22T23:39:07","slug":"tr-96-17-discrete-vector-quantization-for-arbitrary-distance-function-estimation","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1996\/tr-96-17-discrete-vector-quantization-for-arbitrary-distance-function-estimation\/","title":{"rendered":"TR-96-17: Discrete Vector Quantization for Arbitrary Distance Function Estimation"},"content":{"rendered":"

Carleton University
\nTechnical Report<\/a> TR-96-17
\nMay 1996<\/p>\n

Discrete Vector Quantization for Arbitrary Distance Function Estimation<\/h2>\n
\n
\n
\n
\n
\n
\n
B.J. Oommen, I. Kuban Altinel, Necati Aras<\/div>\n<\/div>\n<\/div>\n
\n

Abstract<\/h3>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n
\n

There are currently many vastly di\u000berent areas of research involving adaptive learning. Two of these are the ones which concern neural networks and learning automata. This paper develops a method by which the general philosophies of Vector Quantization (VQ) and discretized automata learning can be incorporated for the computation of arbitrary distance functions. The latter is a problem which has important applications in Logistics and Location Analysis. The input to our problem is the set of coordinates of a large number of nodes whose inter-node arbitrary “distances” have to be estimated. To render the problem interesting, non-trivial and realistic, we assume that the explicit form of this distance function is both unknown and uncomputable. Unlike traditional Operations Research methods, which use optimized parametric functional estimators, we have utilized discretized VQ principles to \ffirst adaptively polarize the nodes into sub-regions. Subsequently, the parameters characterizing the sub-regions are learnt by using a variety of methods (including, for academic purposes a VQ strategy in the meta-domain). After an initial training phase, a system which achieves distance estimation attempts to yield an estimate of any node-pair distance without actually deriving an explicit form for the unknown function. The algorithms have been rigorously tested for the actual road-travel distances involving cities in Turkiye and the results obtained are conclusive. Indeed, these present results are the best currently available from any single or hybrid strategy.<\/p>\n

TR-96-17.pdf<\/a><\/p>\n<\/div>\n","protected":false},"excerpt":{"rendered":"

Carleton University Technical Report TR-96-17 May 1996 Discrete Vector Quantization for Arbitrary Distance Function Estimation B.J. Oommen, I. Kuban Altinel, Necati Aras Abstract There are currently many vastly di\u000berent areas of research involving adaptive learning. Two of these are the ones which concern neural networks and learning automata. This paper develops a method by which […]<\/p>\n","protected":false},"author":49,"featured_media":0,"parent":12155,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_relevanssi_hide_post":"","_relevanssi_hide_content":"","_relevanssi_pin_for_all":"","_relevanssi_pin_keywords":"","_relevanssi_unpin_keywords":"","_relevanssi_related_keywords":"","_relevanssi_related_include_ids":"","_relevanssi_related_exclude_ids":"","_relevanssi_related_no_append":"","_relevanssi_related_not_related":"","_relevanssi_related_posts":"","_relevanssi_noindex_reason":"","_mi_skip_tracking":false,"_exactmetrics_sitenote_active":false,"_exactmetrics_sitenote_note":"","_exactmetrics_sitenote_category":0,"footnotes":"","_links_to":"","_links_to_target":""},"yoast_head":"\nTR-96-17: Discrete Vector Quantization for Arbitrary Distance Function Estimation - School of Computer Science<\/title>\n<meta name=\"description\" content=\"Carleton University Technical Report TR-96-17 May 1996 Discrete Vector Quantization for Arbitrary Distance Function Estimation B.J. Oommen, I. Kuban\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1996\/tr-96-17-discrete-vector-quantization-for-arbitrary-distance-function-estimation\/\" \/>\n<meta name=\"twitter:label1\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data1\" content=\"1 minute\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1996\/tr-96-17-discrete-vector-quantization-for-arbitrary-distance-function-estimation\/\",\"url\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1996\/tr-96-17-discrete-vector-quantization-for-arbitrary-distance-function-estimation\/\",\"name\":\"TR-96-17: Discrete Vector Quantization for Arbitrary Distance Function Estimation - School of Computer Science\",\"isPartOf\":{\"@id\":\"https:\/\/carleton.ca\/scs\/#website\"},\"datePublished\":\"2021-11-22T23:38:12+00:00\",\"dateModified\":\"2021-11-22T23:39:07+00:00\",\"description\":\"Carleton University Technical Report TR-96-17 May 1996 Discrete Vector Quantization for Arbitrary Distance Function Estimation B.J. Oommen, I. Kuban\",\"breadcrumb\":{\"@id\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1996\/tr-96-17-discrete-vector-quantization-for-arbitrary-distance-function-estimation\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1996\/tr-96-17-discrete-vector-quantization-for-arbitrary-distance-function-estimation\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1996\/tr-96-17-discrete-vector-quantization-for-arbitrary-distance-function-estimation\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/carleton.ca\/scs\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Research\",\"item\":\"https:\/\/carleton.ca\/scs\/research\/\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"SCS Technical Reports\",\"item\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/\"},{\"@type\":\"ListItem\",\"position\":4,\"name\":\"Technical Reports 1996\",\"item\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1996\/\"},{\"@type\":\"ListItem\",\"position\":5,\"name\":\"TR-96-17: Discrete Vector Quantization for Arbitrary Distance Function Estimation\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/carleton.ca\/scs\/#website\",\"url\":\"https:\/\/carleton.ca\/scs\/\",\"name\":\"School of Computer Science\",\"description\":\"Carleton University\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/carleton.ca\/scs\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"en-US\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"TR-96-17: Discrete Vector Quantization for Arbitrary Distance Function Estimation - School of Computer Science","description":"Carleton University Technical Report TR-96-17 May 1996 Discrete Vector Quantization for Arbitrary Distance Function Estimation B.J. Oommen, I. Kuban","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1996\/tr-96-17-discrete-vector-quantization-for-arbitrary-distance-function-estimation\/","twitter_misc":{"Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1996\/tr-96-17-discrete-vector-quantization-for-arbitrary-distance-function-estimation\/","url":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1996\/tr-96-17-discrete-vector-quantization-for-arbitrary-distance-function-estimation\/","name":"TR-96-17: Discrete Vector Quantization for Arbitrary Distance Function Estimation - School of Computer Science","isPartOf":{"@id":"https:\/\/carleton.ca\/scs\/#website"},"datePublished":"2021-11-22T23:38:12+00:00","dateModified":"2021-11-22T23:39:07+00:00","description":"Carleton University Technical Report TR-96-17 May 1996 Discrete Vector Quantization for Arbitrary Distance Function Estimation B.J. Oommen, I. Kuban","breadcrumb":{"@id":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1996\/tr-96-17-discrete-vector-quantization-for-arbitrary-distance-function-estimation\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1996\/tr-96-17-discrete-vector-quantization-for-arbitrary-distance-function-estimation\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1996\/tr-96-17-discrete-vector-quantization-for-arbitrary-distance-function-estimation\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/carleton.ca\/scs\/"},{"@type":"ListItem","position":2,"name":"Research","item":"https:\/\/carleton.ca\/scs\/research\/"},{"@type":"ListItem","position":3,"name":"SCS Technical Reports","item":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/"},{"@type":"ListItem","position":4,"name":"Technical Reports 1996","item":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1996\/"},{"@type":"ListItem","position":5,"name":"TR-96-17: Discrete Vector Quantization for Arbitrary Distance Function Estimation"}]},{"@type":"WebSite","@id":"https:\/\/carleton.ca\/scs\/#website","url":"https:\/\/carleton.ca\/scs\/","name":"School of Computer Science","description":"Carleton University","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/carleton.ca\/scs\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-US"}]}},"acf":{"banner_image_type":"none","banner_button":"no"},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12851"}],"collection":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/users\/49"}],"replies":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/comments?post=12851"}],"version-history":[{"count":2,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12851\/revisions"}],"predecessor-version":[{"id":12853,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12851\/revisions\/12853"}],"up":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12155"}],"wp:attachment":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/media?parent=12851"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}