Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(4)
Distance Function
Operations Research
Self Organized Map
Vector Quantizer
Subscribe
Academic
Publications
Arbitrary distance function estimation using vector quantization
Arbitrary distance function estimation using vector quantization,10.1109/ICNN.1995.487272,B. John Oommen,I. Kuban Altinel,N. Aras
Edit
Arbitrary distance function estimation using vector quantization
(
Citations: 1
)
BibTex

RIS

RefWorks
Download
B. John Oommen
,
I. Kuban Altinel
,
N. Aras
In this paper we shall utilize the concepts of vector quantization (VQ) for the computation of arbitrary distance functionsa problem which has been receiving much attention in the
operations research
and location analysis community. The input to our problem is the set of coordinates of a large number of nodes whose internode arbitrary “distances” have to be estimated. Unlike traditional
operations research
methods, which use parametric functional estimators, we have utilized VQ principles to first adaptively polarize the nodes into subregions according to Kohonen's selforganizing map. Subsequently, the parameters characterizing the subregions are learnt by using a variety of methods
Conference:
International Symposium on Neural Networks  ISNN
, 1995
DOI:
10.1109/ICNN.1995.487272
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
ieeexplore.ieee.org
)
(
ieeexplore.ieee.org
)
Citation Context
(1)
...In two earlier works [5], [
47
], we demonstrated that the principles of VQ could be utilized naturally and powerfully to solve the arbitrary distance estimation problem...
...Indeed, the solution proposed in [5] and [
47
] was a sequence of pattern recognition and polarizing modules governed by the laws of VQ. The salient contribution of this present paper is that we have shown that by merging the learning principles of two families of adaptive algorithms we can achieve an enhanced superior learning algorithm...
...However, in the method proposed in [5], [
47
], the region of interest is subdivided into a set of subregions adaptively using a VQ method, and in our current work this has been done by only restricting ourselves to “integer” points on the grid...
...Although, perceptronbased nonparametric estimators perform better compared to parametric distance functions, (i.e., they yield smaller errors), the results can be improved further if the cities are clustered adaptively using a VQ [5], [
47
] DVQ method prior to any estimation attempt...
...Note that this can be seen to be the discretized version of the traditional SOM strategy [21], [24], [25], [30], [37] except that we have (as in [5], [
47
]) consistently restricted the radius of the “bubble of interest” used by Kohonen to be unity...
...This is as recommended in the literature [24], [25] and has been justified in the continuous domain [5], [
47
]...
... of interest, This restriction has also been recommended in the literature [24], [25], and typically, this window, , is a hypersphere centered at the bisector between the codebook vectors and Also, as recommended in the literature, the polarizing of both and (when both of them correctly classify ) is made to be of much smaller magnitude than in the scenario when either of them misclassifies it. These steps are formally given in [5] and [
47
] ...
...In all the experiments reported in earlier publications involving Turkey [4], [5], [
47
], the original map of Turkey was enclosed within a bounding rectangle defined between the latitudes and longitudes 36 N, 26 E, 42 N, and 45 E, respectively...
...Also, in the interest of comparing the current discretized work with its continuous counterpart [5], [
47
], the results which we report and the initial partitions are exactly the same as those for which we had reported earlier results in [5], [47]...
...Also, in the interest of comparing the current discretized work with its continuous counterpart [5], [47], the results which we report and the initial partitions are exactly the same as those for which we had reported earlier results in [5], [
47
]...
...This should be compared with the results for the continuous VQ scheme [5], [
47
] where the most conservative case (obtained by averaging in the space) yielded a testing error of 7.69, and in the case when the functions are characterized by the test error was 7.12...
...Observe too that like the continuous scheme [5], [
47
] the most time consuming phase of the learning is the optimization stage...
...Generally speaking, the accuracy is comparable to the other reported schemes (other than the continuous VQ scheme [5], [
47
]) for small values of This accuracy increases remarkably with the magnification as increases from 2 to 8 and then tends to stabilize thereafter...
...Note that in the random case cited for the continuous VQ algorithm [5], [
47
], the corresponding errors were 1.787 and 7.189, respectively...
...Unlike for the continuous VQ algorithm [5], [
47
] we have not been able to determine any initial 2partitions with six codebook vectors in each which can yield superior classification and testing...
...or hybrid strategy and are often superior even to the case when continuous VQ was used for the polarizing [5], [
47
]...
...Finally, arguing as in [5], [
47
], we believe that the VQ and its discretized counterpart are superior to the perceptronbased methods because unlike the latter, the distance function itself is defined on a welldefined Euclidean space...
B. John Oommen
,
et al.
Discrete vector quantization for arbitrary distance function estimatio...
References
(16)
Fedor Krause (18571937)
(
Citations: 3
)
Norman H. Horwitz
Journal:
Neurosurgery
, vol. 39, no. 6, pp. 844848, 1996
The infratentorial supracerebellar approach to pineal lesions
(
Citations: 70
)
Bennett M. Stein
Journal:
Journal of Neurosurgery  JNS
, vol. 35, no. 2, pp. 197202, 1971
Operative approaches to the pineal region tumors
(
Citations: 6
)
Masashi Fukui
,
Yoshihiro Natori
,
Toshio Matsushima
,
Shunji Nishio
,
Kiyonobu Ikezaki
Journal:
Childs Nervous System  CHILD NERV SYST
, vol. 14, no. 1, pp. 4952, 1998
The infratentorialsupracerebellar exposure of tumors in the pineal area
(
Citations: 19
)
L K Page
Journal:
Neurosurgery
, vol. 1, no. 1, 1977
Comparison of the infratentorial and transtentorial approaches to the pineal region
(
Citations: 34
)
W S Reid
,
W K Clark
Journal:
Neurosurgery
, vol. 3, no. 1, 1978
Sort by:
Citations
(1)
Discrete vector quantization for arbitrary distance function estimation
(
Citations: 1
)
B. John Oommen
,
I. Kuban Altinel
,
Necati Aras
Journal:
IEEE Transactions on Systems, Man, and Cybernetics  TSMC
, vol. 28, no. 4, pp. 496510, 1998