This is a repository copy of
Improved AURA k-Nearest Neighbour approach
.
White Rose Research Online URL for this paper:
http://eprints.whiterose.ac.uk/769/
Proceedings Paper:
Weeks, M., Hodge, V. orcid.org/0000-0002-2469-0224, O'Keefe, S.
orcid.org/0000-0001-5957-2474 et al. (2 more authors) (2003) Improved AURA k-Nearest
Neighbour approach. In: Mira, J and Alvarez, JR, (eds.) ARTIFICIAL NEURAL NETS
PROBLEM SOLVING METHODS, PT II. 7th International Work Conference on Artificial
and Natural Neural Networks, 03-06 Jun 2003 Lecture Notes in Computer Science .
SPRINGER-VERLAG BERLIN , MENORCA , pp. 663-670.
eprints@whiterose.ac.uk
https://eprints.whiterose.ac.uk/
Reuse
Items deposited in White Rose Research Online are protected by copyright, with all rights reserved unless
indicated otherwise. They may be downloaded and/or printed for private study, or other acts as permitted by
national copyright laws. The publisher or other rights holders may allow further reproduction and re-use of
the full text version. This is indicated by the licence information on the White Rose Research Online record
for the item.
Takedown
If you consider content in White Rose Research Online to be in breach of UK law, please notify us by
White Rose Consortium ePrints Repository
http://eprints.whiterose.ac.uk/
This is an author produced version of a chapter published in 7th International
Work-Conference on Artificial and Natural Neural Networks, IWANN2003 Maó, Menorca,
Spain, June 3-6, 2003 Proceedings, Part II: Artifical Neural Nets Problem Solving
Methods.
White Rose Repository URL for this paper:
http://eprints.whiterose.ac.uk/archive/00000769/
Citation for the published chapter
Weeks, M. and Hodge, V. and O'Keefe, S. and Austin, J. and Lees, K. (2003) Improved
AURA k-nearest neighbour approach. In: Mira, J. and Alvarez, J.R., (eds)
.
7th
International Work-Conference on Artificial and Natural Neural Networks, IWANN2003
Maó, Menorca, Spain, June 3-6, 2003 Proceedings, Part II: Artificial Neural Nets
Problem Solving Methods. Lecture Notes in Computer Science, 2687. Springer Verlag,
Berlin, Germany, pp. 663-670
Citation for this chapter
To refer to the repository paper, the following format may be used:
Weeks, M. and Hodge, V. and O'Keefe, S. and Austin, J. and Lees, K. (2003) Improved
AURA k-nearest neighbour approach. Author manuscript available at:
http://eprints.whiterose.ac.uk/archive/00000769/. [Accessed: date].
Published in final edited form as:
Weeks, M. and Hodge, V. and O'Keefe, S. and Austin, J. and Lees, K. (2003) Improved
AURA k-nearest neighbour approach. In: Mira, J. and Alvarez, J.R., (eds)
.
7th
International Work-Conference on Artificial and Natural Neural Networks, IWANN2003
Maó, Menorca, Spain, June 3-6, 2003 Proceedings, Part II: Artificial Neural Nets
Problem Solving Methods. Lecture Notes in Computer Science, 2687. Springer Verlag,
Berlin, Germany, pp. 663-670
!!" #!!$ %
& ' ( )
% ' %(
*!! '
%%+( "
"% %& (
, " % ) !!
"( ) " " "
% -
(. % )
" " " - !!
'( % " ) /
% " "!!
' %
!! (
! "# ! !$
%& ' (()
!$*+℄%-
..! #
.% !
.#!%
/ ! 01 (( .*2℄%
01$.#$..$! $
$ 3 $
% / $
#$%0$
01
.3%&..
$# ((% & !$
-4501 6
. . 01 . . % / *:℄!! 01 (( ! ;<< ((
%!##
01 #!"=%
#
! % -
' +)% !#
. #
! % & =
' 7)%
')
>
'
)
'+)
')
>
'7)
? . 7$
'=+)!".%& #
! @%
!%
Distance
score
Attribute A
Attribute B
Distance
score
Attribute A
Attribute B
(a)
(b)
. #$ " #"$ #$
01 '# 0 1)
$ 3
*A℄%01.
" #=$#.
!%
01 .$. ! ;$
3 '; )% & # ;
. #@@$ .%01=3$
$ .! 3 # !
# % &
.# %01$
!. !.!
3B +C= %
; .3!
##% 4
3 !
% & ; ! D
% / . #
; 3 ! '.) % &
3 : A !
¼
; !
3
; 3 % ¨
1
% .; %
¼
>C ':)
> ½
¨
¡
¾ 'A)
>
'B)
&; .# ;
3% 1! ..
; # ' B)% &
..
=.#.
%
. ! '# ) #%&
; ! . !
#%&!
. '! 3) %! *B℄
! # !
3*E℄#%
; ! .*2℄%
; # #
!. .6 ; . .%
.#..$#.
..! %
;# ((01$.$
$..#! 3%&
((#; !F$$
3.01; %&
$ (( G
-')
-. '!)
/; G
-.'!)
-')
&!01!=!'.)
! ! %
& .; %
& # ; 3
((% & ! # . 01
$ . # ((% .
! . "% & . # .
! . % #
. .
..% # -45016*7℄
#...#%
. . . .
! 6 .% & ! # # 6
. . . % & .
#.. $.
.01..*:℄%
-7')!!
.$! . '$. ) 7$
. '7$) .% (
3$.#
+ '%% )% 1 +
! = ! . .
3 % C .
3+%
. # . . '!) $
#= #3!
2%
+ 'E)
' +) '2)
/ (( 01 !
#.$!. $!
%-.!# !
..%
& 6
%& ! . 3$
' ) ! $
' 2)% &! !G
. $
$ $ $
%/$ $
$$#%-7'.)7')
. ' ) .
!$%/ .! $
!
! (( . $ '= +)% (
01$ (( (( # 3
! # ! % & $
3 !$
#$%&$
% -#! #
Distance
score
Distance
score
Attribute A
Attribute B
Attribute A
Attribute B
Distance
score
Attribute A
Attribute B
(a)
(b)
(c)
. ) #$ 0 #$
" # "$#"$#$
>HH% # . #.01
!') ! "#%
#%#!#!
3 . =
.4 (( . #
# .$%
#: D& $;.
' :$? ) %/ !
. . .
') 3 . . .
.#3
.. !%
# ; ?
5 I%
')> ') 7 ' ) ! > ') 'I)
# 4$
5 H
½ %
')> ') 7 ¾ ' ) ¾ ! > ') ¾ ¾ 'H) ; $ # : ; . # $#!# .$##.!% (( .
;<<% 45
' +C) . ! . !
.# !01#%!
. # . F . !%
"
.%
.%
& #$;%01#$
.!.# ((#
!! %
-#!G
& 1 0;/ *I℄% &
7CCCC#+A$.$#$
. C$+B%
7CCCCC#+A$#.!
#.!C+%&!#
.%
7CCCC # H $# . !
.!C$A C$+:AHECC%& !
/? *H℄ ! % ( ! #
= . %
- # !
...!
#%&!.
.# .%
+C. 1 '1+C) #
. % . .'7B)14
'147B).#.!C+
. .% - = /?
. ! ! +C 7B .
'/? +CJ/? 7B)#!.!.
".!A+:AHECC%
HH#.
'1+C147B/? +C/? 7B)HH
#. (( ;<<% &!#$
01 $ ! "#
%K$$
.! .%&! .
.HH!.%
/.+!#
.%&$ !
. &% & :$? % & &
$;Æ'#HHL)
%&".! !
88(98 88(86 344(44 344(44 88(6: 344(44 344(44 344(44 ; 1 <8(0: 3:(43 =;(63 60(;;
" #$
(% ,17 (
.&$;
!.%-!
. .
.01 *:℄%
K# ! *:℄ ! 01$ .
%&#.01
= 3 . $
..! %/ !
##.
01 . ! .
%
3( (>( 17 2 ( .
? 3889
0( @. /
( ABB%%%(( ((BB
;( C( DE( ( . !! 1!
!% ( " 50440(
9( E E 2( )
( , 3886(
6( (E(>%?(.(1((2 ( ! 7 ( !000#38=8$ 8=4 8=0(
=( (.(1( (( .)
( !!% 6#9$063 0=33880(
:( E ( " 7 " )
( ,(E(@++<000; 0;;388=(
<( ,17( FA7 F #0$'
A ABB%%%(("( BB&B(
8( (2(1(E( 7+( , ) "(
, , 388<