Professional Documents
Culture Documents
4 (2003) 375390
c iKMS & World Scientific Publishing Co.
Keywords: Web mining; knowledge discovery; business intelligence; hybrid soft computing; neuro-fuzzy-genetic system.
376
A. Abraham
Fig. 1.
Web structure/content
information
Business services
Pattern analysis
Pattern discovery
Business intelligence
Data pre-processing
Web server
and cleaning
Usage statistics
ISP
Sequential/association
rule mining
Customer / Client
Fig. 2.
377
Fig. 3.
Fig. 4.
378
A. Abraham
Log files
D ata
prep ro c ess in g
Fu zzy
clus terin g
Evolutionary
learning
Fu zzy Infe re nc e
S ys te m
Evolutionary
learning
Fig. 5.
i-Miner framework.
Neural
learning
Fig. 6.
379
i=1 j=1
where uij is a numerical value between [0, 1]; ci is the cluster center of fuzzy group i; dij = kci xj k is the Euclidian
distance between ith cluster center and jth data point;
and m is called the exponential weight which influences
the degree of fuzziness of the membership (partition)
matrix.
of its local minima. No guarantee ensures that FCM converges to an optimum solution (can be trapped by local
extrema in the process of optimizing the clustering criterion). The performance is very sensitive to initialization
of the cluster centers. An evolutionary algorithm is used
to decide the optimal number of clusters and their cluster
centers. The algorithm is initialized by constraining the
initial values to be within the space defined by the vectors
to be clustered. A very similar approach is given in (Hall
et al., 2001). In the i-Miner approach, the fuzzy clustering
algorithm is optimized jointly with the trend analysis algorithm (fuzzy inference system) in a single global search.
(2)
After that, all model vectors or a subset of them that belong to nodes centered around node c = c(x) are updated
380
A. Abraham
as
mi (t + 1) = mi (t) + hc(x),i (x(t) mi (t)) .
(3)
E
+ wij (n 1) .
wij
(4)
The gradient gives the direction of error E. The parameters and are the learning rate and momentum
respectively.
Fig. 7.
input variables
1
Fig. 8.
381
output variable
1
Chromosome representing an individual fuzzy rule (3 input variables and 1 output variable).
(5)
It is observed that
lim T (a, b, p) = ab
p0
(6)
which correspond to two of the most frequently used Tnorms in combining the membership values on the premise
part of a fuzzy if-then rule.
382
A. Abraham
N
X
(dk xk )2
(7)
k=1
where dk is the kth component of the rth desired output vector and xk is the kth component of the actual
output vector by presenting the rth input vector to the
network. All the gradients of the parameters to be optiE
mized, namely the consequent parameters P
for all rules
n
E
E
Rn and the premise parameters i and ci for all fuzzy
sets Fi ( and c represents the MF width and center of a
Gaussian MF).
Once the three layers are represented in a chromosome C, and then the learning procedure could be
initiated as follows:
a. Generate an initial population of N numbers of C
chromosomes. Evaluate the fitness of each chromosome
depending on the output error.
b. Depending on the fitness and using suitable selection methods reproduce a number of children for each
individual in the current generation.
c. Apply genetic operators to each child individual
generated above and obtain the next generation.
d. Check whether the current model has achieved the required error rate or the specified number of generations
has been reached. Go to Step b.
e. End
Population size
Maximum no of generations
Fuzzy inference system
Rule antecedent membership functions
Rule consequent parameters
Gradient descent learning
Ranked based selection
Elitism
Starting mutation rate
30
35
Takagi Sugeno
3 membership functions per input variable (parameterized Gaussian)
linear parameters
10 epochs
0.50
5%
0.50
i - Miner
383
training performance
0.12
0.1
0.08
0.06
0.04
0.02
0
1
11
16
21
26
31
i - Miner
test performance
0.12
0.1
0.08
0.06
0.04
0.02
0
1
11
16
21
26
31
384
A. Abraham
Table 2.
Method
Train
Test
CC
Train
Test
CC
i-Miner
TKFIS
ANN
LGP
0.0044
0.0176
0.0345
0.0543
0.0053
0.0402
0.0481
0.0749
0.9967
0.9953
0.9292
0.9315
0.0012
0.0433
0.0546
0.0654
0.0041
0.0433
0.0639
0.0516
0.9981
0.9841
0.9493
0.9446
Daily requests
1200
900
600
300
! ! ! ! ! ! ! ! !
i-Miner
FIS
ANN
LGP
Fig. 11.
$'$$'$
Actual no of requests
u$u
$'$$'$
i-Miner
140
[$[
-'E$- E u$$u
w$w
$'$$'$
`'`x$x
y'y
$$''$$$$''$
-'E$- ]'E ] u$$u F'. F$. ^F $v /$G'/ G_$_ w$'w 0'0$H$0 `'H `x$'x 1$I'1 I y'y
z'z
-'E$- ]'E ] u$$u F'. F$. ^F $v /$G'/ G_$_ w$'w 0'0$H$0 `'H `x$'x 1$I'1 Ia$y'a $y
z'$z
-'E$- ]'E ] u$$u F'. F$. ^F $v /$G'/ G_$_ w$'w 0'0$H$0 `'H `x$'x 1$I'1 Ia$y'a $y 2$J'2 Jb$z'b $z
p'$p )$A') Y$A q$Y q *'B$* Z$B r'Z $r +$C'+ [$C s'[ $s ,$D$, \'D \ 't
-'E$- ]'E ] u$$u F'. F$. ^F $v /$G'/ G_$_ w$'w 0'0$H$0 `'H `x$'x 1$I'1 Ia$y'a $y 2$J'2 Jb$z'b $z
R$j'R j
&'?$& W'? o$W $o ($@'( X$@ p'X $p )$A') Y$A q$Y 'q *'B$* Z$B r'Z $r +$C'+ [$C s'[ $s ,$D$, \'D \ 't
-'E$- ]'E ] u$$u F'. F$. ^F $v /$G'/ G_$_ w$'w 0'0$H$0 `'H `x$'x 1$I'1 Ia$y'a $y 2$J'2 Jb$z'b $z
${
:'R$: j'R j
&'?$& W'? o$W $o ($@'( X$@ p'X $p )$A') Y$A q$Y 'q *'B$* Z$B r'Z $r +$C'+ [$C s'[ $s ,$D$, \'D \ 't
-'E$- ]'E ] u$$u F'. F$. ^F $v /$G'/ G_$_ w$'w 0'0$H$0 `'H `x$'x 1$I'1 Ia$y'a $y 2$J'2 Jb$z'b $z
${
&'?$& W'? o$W $o ($@'( X$@ p'X $p )$A') Y$A q$Y 'q *'B$* Z$B r'Z $r +$C'+ [$C s'[ $s ,$D$, \'D \ 't
-'E$- ]'E ] u$$u F'. F$. ^F $v /$G'/ G_$_ w$'w 0'0$H$0 `'H `x$'x 1$I'1 Ia$y'a $y 2$J'2 Jb$z'b $z 3'3K$c'K c ${
|$$| 5$5
6$N$6 f'N f ' 7$O'7 O$gO $ 8$P'8 h$P h '$ 9'Q$9 Q'iQ $ :'R$: j'R j$$ ;'S$; k$S 'k $ <$T$< l'T l$'
&'?$& W'? o$W $o ($@'( X$@ p'X $p )$A') Y$A q$Y 'q *'B$* Z$B r'Z $r +$C'+ [$C s'[ $s ,$D$, \'D \ 't
-'E$- ]'E ] u$$u F'. F$. ^F $v /$G'/ G_$_ w$'w 0'0$H$0 `'H `x$'x 1$I'1 Ia$y'a $y 2$J'2 Jb$z'b $z 3'3K$c'K c ${
6$N$6 f'N f ~$'~ 7$O'7 O$gO $ 8$P'8 h$P h '$ 9'Q$9 Q'iQ $ :'R$: j'R j$$ ;'S$; k$S 'k $ <$T$< l'T l$'
&'?$& W'? o$W $o ($@'( X$@ p'X $p )$A') Y$A q$Y 'q *'B$* Z$B r'Z $r +$C'+ [$C s'[ $s ,$D$, \'D \ 't
-'E$- ]'E ] u$$u F'. F$. ^F $v /$G'/ G_$_ w$'w 0'0$H$0 `'H `x$'x 1$I'1 Ia$y'a $y 2$J'2 Jb$z'b $z 3'3K$c'K c ${ 4'4L$d'L |$d $| 5$M'5 e$M e '} 6$N$6 f'N f ~$'~ 7$O'7 O$gO $ 8$P'8 h$P h '$ 9'Q$9 Q'iQ $ :'R$: j'R j$$ ;'S$; k$S 'k $ <$T$< l'T l$'
120
100
p'p
n$n
80
60
FIS
o$$o
$'$$'$
ANN
LGP
Web traffic trends
O'O$O
h$h
9'Q$9 Q'iQ
'$
40
20
10
11
12
13
14
15
16
4'4L$d'L d
17
'}
18
19
20
21
22
23
24
Fig. 12.
respectively. The previous study using Self-organizing Map (SOM) created 7 data
clusters (daily traffic volume) and 4 data clusters (hourly traffic volume) respectively.
The main advantage of SOMs comes from the easy visualization and interpretation of
clusters formed by the map. As evident (Figures 13-16), FCM
approachIntelligence
resulted in the from Web Usage Mining
Business
formation of additional data clusters.
!"#$%&'"('-&.$&,/,'
0"$-#1'2&3'4*/*'
5#$,/&-'5&6/&-'
!"#$%&'"(')*+&,'
FCM clustering
- hourly volume
volume of of
requests
and pages
Fig. 13. Figure
FCM13.
clustering
hourly
requests
and pages.
("#$.,%3)4%*+'+%
5.#2')$%5)6')$%
-".#/)%"&%$)8#)2'2%
-".#/)%"&%$)8#)2'2%
("#$.,%3)4%*+'+%
5.#2')$%5)6')$%
!"#$%"&%'()%*+,%
!"#$%"&%'()%*+,%
FCM clustering
- hourofof the
the day
andand
volume
of requests
Fig. 14. Figure
FCM 14.
clustering
hour
day
volume
of requests.
Figure 14. FCM clustering - hour of the day and volume of requests
-".#/)%"&%$)8#)2'2%
-".#/)%"&%$)8#)2'2%
*+7.,%3)4%*+'+%
5.#2')$%5)6')$%
*+7.,%3)4%*+'+%
5.#2')$%5)6')$%
-".#/)%"&%0+1)2%
-".#/)%"&%0+1)2%
Figure 15. FCM clustering daily volume of requests and volume of pages
FCM clustering
dailyvolume
volume of
and volume
of pagesof pages.
Fig. 15. Figure
FCM 15.
clustering
daily
ofrequests
requests
and volume
385
A. Abraham
,"-.#$*)/$,"'"$
0.12')3$0)4')3$
5%.16)$%&$3)71)2'2$
386
!"#$%&$$'()$*))+$
FCM clustering
- dayofofthe
the week
volume
of requests
Fig. 16. Figure
FCM16.clustering
day
weekand
and
volume
of requests.
Figure 17. Hourly visitor information according to the domain names from an FCM
cluster
Fig. 17.
Hourly visitor information according to the domain names from an FCM cluster.
Fig. 18.
Fig. 19.
387
Developed SOM clusters showing the different input variables (title of each map) for daily Web traffic.
Fig. 20.
Developed SOM clusters showing the different input variables for hourly Web traffic.
meaningful information could be obtained from the clustered data. Depending on the volume of requests and
transfer of bytes, data clusters were formulated. Clusters based on hourly data show the visitor information
at certain hour of the day. Figure 17 depicts the volume of visitors according to domain names from an FCM
cluster. Figure 18 illustrates the volume of visitors in each
FCM cluster according to the day of access. Some clusters accounted for the visitors according to the peak hour
and certain weekday traffic and so on. Clusters developed
using Self-organizing Map (SOM) for daily and hourly
traffic is depicted in Figures 19 and 20 respectively. The
previous study using Self-organizing Map (SOM) created
7 data clusters (daily traffic volume) and 4 data clusters
(hourly traffic volume) respectively. The main advantage
of SOMs comes from the easy visualization and interpretation of clusters formed by the map. As evident (Figs. 13
16), FCM approach resulted in the formation of additional
data clusters.
4. Conclusions
Recently Web usage mining has been gaining a lot of attention because of its potential commercial benefits. The
proposed i-Miner framework seems to work very well for
the problem considered. The empirical results also reveal the importance of using soft computing paradigms
for mining useful information. Several useful information
could be discovered from the clustered data. FCM clustering resulted in more clusters compared to SOM approach.
Perhaps more clusters were required to improve the accuracy of the trend analysis. The main advantage of SOMs
comes from the easy visualization and interpretation of
clusters formed by the map. The knowledge discovered
from the developed FCM clusters and SOM could be a
good comparison study and is left as a future research
topic.
As illustrated in Table 2, i-Miner framework gave the
overall best results with the lowest RMSE on test error
and the highest correlation coefficient. It is interesting to
note that the three considered soft computing paradigms
could easily pickup the daily and hourly Web-access trend
patterns. When compared to LGP, the developed neural
network performed better (in terms of RMSE) for daily
trends but for hourly trends LGP gave better results. An
important disadvantage of i-Miner is the computational
complexity of the algorithm. When optimal performance
is required (in terms of accuracy and smaller structure)
such algorithms might prove to be useful as evident from
the empirical results.
388
A. Abraham
Acknowledgements
Author is grateful to the technical reviewers for the comments, which improved the clarity and presentaion of the
paper. Initial part of the research was done during the
authors stay at Monash University, Australia. Author
wishes to thank Ms. Xiaozhe Wang for all the discussions and contributions during the initial stages of this
research.
References
Abraham, A (2001). Neuro-fuzzy systems: State-of-theart modeling techniques, connectionist models of neurons, learning processes, and artificial intelligence. In
Lecture Notes in Computer Science 2084, J Mira
and A Prieto (eds.), Germany, Spain: Springer-Verlag,
pp. 269276.
(2002). EvoNF: A framework for optimization of
fuzzy inference systems using neural network learning and evolutionary computation. In Proc. of 17th
IEEE International Symposium on Intelligent Control,
pp. 327332, IEEE Press.
(2003). i-Miner: A web usage mining framework
using hierarchical intelligent systems. The IEEE International Conference on Fuzzy Systems FUZZ-IEEE03,
pp. 11291134, IEEE Press.
Aggarwal, C, JL Wolf and PS Yu (1999). Caching on
the World Wide Web. IEEE Transaction on Knowledge and Data Engineering, Vol. 11, No. 1, pp. 94107.
Agrawal, R and R Srikant (1994). Fast algorithms for mining association rules. In Proc. of the 20th International
Conference on Very Large Databases, M Kaufmann, JB
Bocca, M Jarke and C Zaniolo (eds.), pp. 487499.
Analog Website Tracker (2003). (http://www.analog.cx/)
[3 October 2003].
Banzhaf, W, P Nordin, ER Keller and FD Francone
(1998). Genetic Programming: An Introduction on The
Automatic Evolution of Computer Programs and its
Applications. Morgan Kaufmann Publishers, Inc.
Bezdek, JC (1981). Pattern Recognition with Fuzzy Objective Function Algorithms. New York: Plenum Press.
Chakrabarti, S (2003). Mining the Web: Discovering
389
390
A. Abraham
Systems, IEEE Transactions on Power Engineering, Applied Soft Computing, International Journal of Neural,
Parallel & Scientific Computations, International Journal
of Control and Intelligent Systems, Bioinformatics, European Journal of Operational Research, ACM Computing
Reviews, Informatica, etc.
He is the general chair/co-chair of the Intelligent Systems Design and Applications (ISDA) and Hybrid Intelligent Systems (HIS) series of international conferences
that was started in 2001. During the last few years, he
has also served the technical committee of several AI related International conferences and has also given a number of conference tutorials in the area of hybrid intelligent
systems. He is a member of several professional societies
like IEEE, IEEE (CS), ACM, IEE (UK), IEAust and also
works closely with several academic working groups like
EvoNet, EUSFLAT, WFSC, etc.