View stunning SlideShares in full-screen with the new iOS app!Introducing SlideShare for AndroidExplore all your favorite topics in the SlideShare appGet the SlideShare app to Save for Later — even offline
View stunning SlideShares in full-screen with the new Android app!View stunning SlideShares in full-screen with the new iOS app!
Natural Computation for Business Intelligence from Web Usage Mining Ajith Abraham IITA Professorship Program, School of Computer Science and Engineering, Chung-Ang University, Korea, email@example.com Abstract 2. Natural Computation and its IngredientsWeb usage mining attempts to discover useful knowledge Natural Computation is a general term referring tofrom the secondary data obtained from the interactions of computing inspired by nature. The idea is to mimic thethe users with the Web. Web usage mining has become complex phenomena occurring in the nature asvery critical for effective Web site management, creating computational processes in order to enhance the wayadaptive Web sites, business and support services, computation is performed mainly from a problem solvingpersonalization, network traffic flow analysis and so on. point of view. Characteristic for man-designed computingThis paper introduces the various ingredients of natural inspired by nature is the metaphorical use of concepts,computation and further presents the important concepts principles and mechanisms underlying natural systems.of Web usage mining and its various practical The general area of computational intelligence is currentlyapplications. undergoing an important transformation by trying to incorporate computational ideas borrowed from the nature1. Introduction all around us: • Artificial immune systemThe WWW continues to grow at an amazing rate as aninformation gateway and as a medium for conducting • Swarm intelligencebusiness. Web mining is the extraction of interesting and • Evolutionary computationuseful knowledge and implicit information from artifactsor activity related to the WWW. Based on several • Neural computationresearch studies we can broadly classify web mining into • Bacterial foragingthree domains: content, structure and usage mining. Webcontent mining is the process of extracting knowledge • DNA computationfrom the content of the actual web documents (textcontent, multimedia etc.). Web structure mining is • Computing with wordstargeting useful knowledge from the web structure, • Simulated annealinghyperlink references and so on. Web usage miningattempts to discover useful knowledge from the secondary • Cultural algorithmsdata obtained from the interactions of the users with the • Membrane computingweb . Web usage mining has become very critical foreffective web site management, creating adaptive web • Quantum computationsites, business and support services, personalization and • Artificial lifenetwork traffic flow analysis . Natural computation involves ideas/themes • Hybrid approachesinspired from the nature including biological, ecologicaland physical systems. It is an emerging interdisciplinary 2.1 Artificial Neural Networksarea in which a range of techniques and methods are Artificial neural networks have been developed asstudied for dealing with large, complex, and dynamic generalizations of mathematical models of biologicalproblems. nervous systems. In a simplified mathematical model of Natural computation and its key paradigms are the neuron, the effects of the synapses are represented byintroduced in Section 2. In Section 3, web usage mining weights that modulate the effect of the associated inputrelated research is summarized. Further in Section 4 a signals, and the nonlinear characteristic exhibited byframework for web usage mining is presented and some neurons is represented by a transfer function, which isconclusions are also provided towards the end. usually the sigmoid, Gaussian function etc. The neuron impulse is then computed as the weighted sum of the input
signals, transformed by the transfer function. The learning order to develop computational tools for solvingcapability of an artificial neuron is achieved by adjusting engineering problems. The basic idea of AIS is to exploitthe weights in accordance to the chosen learning the immune systems characteristics of learning andalgorithm. The learning situations in neural networks may memory to solve a problem. AIS can be broadlybe classified into three distinct sorts. These are supervised categorized into three subgroups: those using the clonallearning, unsupervised learning and reinforcement selection theory, those using negative selection and thoselearning . using the immune network theory as their main inspiration .2.2. Evolutionary Algorithms (EA) 2.5. Bacterial ForagingEvolutionary algorithms are adaptive methods, which maybe used to solve search and optimization problems, based Selection behavior of bacteria tends to eliminate animalson the genetic processes of biological organisms . with poor foraging strategies and favor the propagation ofOver many generations, natural populations evolve genes of those animals that have successful foragingaccording to the principles of natural selection and strategies. After many generations, a foraging animal takes‘survival of the fittest’. By mimicking this process, actions to maximize the energy obtained per unit timeevolutionary algorithms are able to ‘evolve’ solutions to spent foraging . That is, poor foraging strategies arereal world problems, if they have been suitably encoded. either eliminated or shaped into good ones. EscherichiaUsually grouped under the term evolutionary algorithms coli (E. coli) is a common type of bacteria whose behavioror evolutionary computation, we find the domains of to move comes from a set of up to six rigid 100–200 rpsgenetic algorithms, evolution strategies, evolutionary spinning flagella, each driven as a biological motor. An E.programming, genetic programming and learning coli bacterium alternates between running and tumbling.classifier systems. They all share a common conceptual The chemotactic actions of the bacteria are summarized asbase of simulating the evolution of individual structures follows:via processes of selection, mutation, and reproduction. • If in a neutral medium, alternate tumbles and runs, its action is like performing a search.2.3. Swarm Intelligence • If swimming up a nutrient gradient (or out of noxiousSwarm intelligence is aimed at collective behaviour of substances), or swim longer (climb up nutrient gradientintelligent agents in decentralized systems. Most of the or down noxious gradient) its behavior seeksbasic ideas are derived from the real swarms in the nature, increasingly favorable environments.which includes ant colonies, bird flocking, honeybees, • If swimming down a nutrient gradient (or up noxiousbacteria and microorganisms etc. Swarm models are substance gradient), then search action is to avoidpopulation-based and the population is initialised with a unfavorable environments.population of potential solutions . These individualsare then manipulated (optimised) over many several 2.6. DNA Computationiterations using several heuristics inspired from the social DNA computing is a form of computing which uses DNAbehaviour of insects in an effort to find the optimal (Deoxyribo-Nucleic Acid) and molecular biology, insteadsolution. Ant Colony Optimization (ACO) algorithms are of the traditional silicon-based microprocessors. Just likeinspired by the behavior of natural ant colonies, in the a string of binary data is encoded with ones and zeros, asense that they solve their problems by multi agent strand of DNA is encoded with four bases, represented bycooperation using indirect communication through the letters A, T, C and G (nucleotides) and the datamodifications in the environment. Ants release a certain density is very impressive. An important property of DNAamount of pheromone (hormone) while walking, and each is its double stranded nature with every DNA sequenceant prefers (probabilistically) to follow a direction, which having a natural complement. This complementarityis rich of pheromone. This simple behavior explains why feature makes DNA a unique data structure forants are able to adjust to changes in the environment, such computation and can be exploited in many ways. In theas optimizing shortest path to a food source or a nest. In cell, DNA is modified biochemically (on the molecularACO, ants use information collected during past level) by a variety of enzymes, which are tiny proteinsimulations to direct their search and this information is machines. This mechanism along with some syntheticavailable and modified through the environment. chemistry is responsible for the various DNA computation2.4. Artificial Immune System (AIS) operators .The artificial immune systems like other biologically 2.7. Computing with Wordsinspired techniques, tries to extract ideas from a natural Computing with words is a methodology in which thesystem, in particular the vertebrate immune system, in objects of computation are words and propositions drawn
from a natural language. Computing with words is inspired to complex real-world problems, such as diseaseby the brains crucial ability to manipulate perceptions prevention, stock-market prediction, and data-mining onwithout any measurements or computations. Computing the Internet.with words provides a foundation for a computational 2.11. Membrane Computingtheory of perceptions. A basic difference betweenperceptions and measurements is that, in general, Membrane computing (P systems) is a framework whichmeasurements are crisp, whereas perceptions are fuzzy abstracts from the way live cells process chemical. compounds in their compartmental structure . In a membrane system multisets of objects are placed in the2.8. Simulated Annealing compartments defined by the membrane structure, and theSimulated annealing is based on the manner in which objects evolve by means of reaction rules are also associatedliquids freeze or metals re-crystalize in the process of within the compartments, and applied in a maximallyannealing . In an annealing process, molten metal, parallel, nondeterministic manner. The objects can beinitially at high temperature, is slowly cooled so that the described by symbols or by strings of symbols. Forsystem at any time is approximately in thermodynamic symbol-objects, a set of numbers are computed, and in theequilibrium. If the initial temperature of the system is too case of string-objects a set of strings are computed which islow or cooling is done insufficiently slowly the system more like a language. The objects are able to throughmay become brittle or unstable with forming defects. The membranes and the membranes can dissolve, divide and change their permeability. These features are used ininitial state of a thermodynamic system is set at energy E defining transitions between configurations of the system,and temperature T, holding T constant the initial and sequences of transitions are used to define computations.configuration is perturbed and the change in energy dE is A sequence of transitions is a computation.computed. If the change in energy is negative the newconfiguration is accepted. If the change in energy is 2.12. Quantum Computationpositive it is accepted with a probability given by the In conventional silicon computers, the amount of data isBoltzmann factor exp -(dE/T). This processes is then measured by bits; in a quantum computer, it is measuredrepeated for few iterations to give good sampling statistics by qubits (quantum-bit). A qubit can be a 1 or a 0, or itfor the current temperature, and then the temperature is can exist in a superposition that is simultaneously both 1decremented and the entire process repeated until a frozen and 0 or somewhere in between. The basic principle ofstate is achieved at T=0. quantum computation is that the quantum properties of2.9. Cultural Algorithms particles can be used to represent and structure data, and that devised quantum mechanisms can be used to performCultural Algorithms are computational models of cultural operations with this data .evolution. They consist of two basic components, apopulation space (using evolutionary algorithms), and a 2.13. Hybrid Approachesbelief space. The two components interact by means of a Several adaptive hybrid intelligent systems have in recentvote-inherit-promote protocol . Likewise the years been developed and many of these approaches useknowledge acquired by the problem solving activities of the combination of different knowledge representationthe population can be stored in the belief space in the form schemes, decision making models and learning strategiesof production rules etc. Cultural algorithms represent a to solve a computational task . This integration aimsgeneral framework for producing hybrid evolutionary at overcoming limitations of individual techniques throughsystems that integrate evolutionary search and domain hybridization or fusion of various techniques. It is wellknowledge. known that the intelligent systems, which can provide2.10. Artificial Life human like expertise such as domain knowledge, uncertain reasoning, and adaptation to a noisy and timeArtificial life (alife) attempts at setting up systems with varying environment, are important in tackling practicallife like properties which all biological organisms possess, computing problems. In contrast with conventionalsuch as reproduction, homeostasis, adaptability etc. Alife artificial intelligence techniques which only deal withis often described as attempting to understand high-level precision and certainty the guiding principle of hybridbehavior from low-level rules; for example, how the approaches is to exploit the tolerance for imprecision,simple rules of Darwinian evolution lead to high-level uncertainty, robustness and to provide optimal solutionsstructure, or the way in which the simple interactions etc.between ants and their environment lead to complex trail-following behavior . Understanding this relationshipin particular systems promises to provide novel solutions
removed by only looking for HTML file requests. In Figure 2, we present a web usage-mining frameworkNormalization of URL’s is often required to make the using natural computing techniques . Clustering of therequests consistent. For example requests for log data helps to segregate similar visitors and the www.okstate.edu function approximation algorithm takes care of analyzing or the visitor patterns and developing some trends. We www.okstate.edu/index.html started this research using a simple architecture consistingare all for the same file. of a pre-processing block followed by self-organizing map Session identification and reconstruction consists of (clustering) and neural network (function approximation).identifying the different users’ sessions from the usually To improve the performance, we further investigatedvery poor information available in log files and various hybrid combinations to cluster similar visitorsreconstructing the users’ navigation path within the based on the domain of origin, no of pages requested, timeidentified sessions. Most of the problems encountered in of access etc. For data clustering, self-organizing maps,this phase are caused by the caching performed either by evolutionary fuzzy clustering algorithm  and ant colonyproxy servers either by browsers. Data formatting is the clustering algorithm  were used. The clustered data isfinal step of preprocessing in which data are properly then used to analyze the trends using several functionformatted before applying data mining techniques. approximation algorithms like neural networks; Takagi- Most of the Web usage mining applications research Sugeno fuzzy inference system trained using neuraleffort focuses on three main paradigms: association rules, network learning ; and linear genetic programming .sequential patterns, clustering and prediction . To demonstrate the efficiency of the proposedAssociation rules are used to find associations among frameworks, web access log data at the MonashWeb pages that frequently appear together in users’ University’s web site  were used for experimentations.sessions. Sequential pattern discovery exposes sequential Readers are advised to consult  and  for furthernavigation patterns that appear in users’ sessions details about the experiments and results.frequently. Clustering has been widely used to grouptogether similar sessions/access patterns. Prediction 4. Conclusionsmethods are used to forecast the volume of visitors /number of server accesses etc. This paper introduced the various ingredients and basic Jespersen et al.  proposed an hybrid approach for ideas of some of the important natural computationanalyzing the visitor click sequences. A combination of techniques. Further the importance of web usage miningHypertext Probabilistic Grammar (HPG) and click fact in business intelligence was presented with an emphasistable approach is used to mine web logs, which could be on data sources, data pre-processing and some relatedalso used for general sequence mining tasks. In HPG, a research.non-terminal symbol corresponds to a web page and aproduction rule corresponds to a hypertext link.Mobasher et al.  proposed the web personalization Acknowledgementssystem that consists of offline tasks related to the miningof usage data and online process of automatic web page This research was supported by the International Jointcustomization based on the knowledge discovered. Research Grant of the IITA (Institute of Information LOGSOM proposed by Smith et al. , utilizes self- Technology Assessment) foreign professor invitationorganizing map to organize web pages into a two- program of the MIC (Ministry of Information anddimensional map based solely on the users’ navigation Communication), Korea.behavior, rather than the content of the web pages. LumberJack proposed by Chi et al.  builds up user Referencesprofiles by combining both user session clustering andtraditional statistical traffic analysis using K-meansalgorithm.  Abraham. A., Business Intelligence from Web Usage Joshi et al.  used relational online analytical Mining, Journal of Information & Knowledgeprocessing approach for creating a web log warehouse Management (JIKM), World Scientific Publishingusing access logs and mined logs (association rules and Co., Singapore, Vol. 2, No. 4, pp. 375-390, 2003.clusters). Holden and Freitas  used an ant colonyalgorithm for Web page classification. A comprehensive  A. Abraham, “i-Miner: A Web Usage Miningoverview of web usage mining research is found in Framework Using Hierarchical Intelligent Systems”,. The IEEE International Conference on Fuzzy
Systems FUZZ-IEEE03, USA, IEEE Press, pp.  F. Masseglia, P. Poncelet, and R. Cicchetti, “An 1129-1134, 2003. Efficient Algorithm for Web Usage Mining”, Networking and Information Systems Journal (NIS), Abraham A. and Ramos V., Web Usage Mining vol.2, no. 5-6, pp. 571-603, 1999. Using Artificial Ant Colony Clustering and Genetic Programming, 2003 IEEE Congress on Evolutionary  Mobasher, R. Cooley, and J. Srivastava, “Creating Computation (CEC2003), Australia, IEEE Press, Adaptive Web Sites through Usage-based Clustering ISBN 0780378040, pp. 1384-1391, 2003. of URLs”, In Proceedings of 1999 Workshop on Knowledge and Data Engineering Exchange, USA, A. Abraham, “Neuro-Fuzzy Systems: State-of-the- pp.19-25, 1999. Art Modeling Techniques”, in Jose Mira and Alberto Prieto, eds., Connectionist Models of Neurons,  Monash University Web site: Learning Processes, and Artificial Intelligence, http://www.monash.edu.au Springer Verlag Germany, 2001, pp. 269-276.  M. Perkowitz, and O. Etzioni, “Adaptive Web Sites: W. Banzhaf, P. Nordin, E.R. Keller, and F.D. Automatically Synthesizing Web Pages”, Francone, “Genetic Programming: An Introduction Proceedings of the 15th National Conference on on The Automatic Evolution of Computer Programs Artificial Intelligence, pp. 727-732, 1998. and its Applications”, Morgan Kaufmann Publishers, Inc., 1998  P. Pirolli, J. Pitkow, and R. Rao, “Silk From a Sow‘s Ear: Extracting Usable Structures from the Web”, E.H. Chi, A. Rosien, and J. Heer, “LumberJack: Proceedings on Human Factors in Computing Intelligent Discovery and Analysis of Web User Systems (CHI’96), ACM Press, 1996. Traffic Composition”, In Proceedings of ACM- SIGKDD Workshop on Web Mining for Usage  K.A. Smith and A. Ng, “Web page Clustering Using Patterns and User Profiles, Canada, ACM Press, a Self-organizing Map of User Navigation Patterns”, 2002. Decision Support Systems, Volume 35, Issue 2, pp. 245-256, 2003. R. Cooley, “Web Usage Mining: Discovery and Application of Interesting patterns from Web Data”,  M. Spiliopoulou, and L.C. Faulstich, “WUM: A Ph. D. Thesis, University of Minnesota, Department Web Utilization Miner”, Proceedings of EDBT of Computer Science, 2000. Workshop on the Web and Data Bases (WebDB’98), Springer Verlag, pp. 109-115, 1999. J. Heer, and E.H. Chi, “Identification of Web User Traffic Composition using Multi- Modal Clustering  J. Srivastava, R. Cooley, M. Deshpande, and P.N. and Information Scent”, In Proc. of the Workshop on Tan, Web Usage Mining: Discovery and Web Mining, SIAM Conference on Data Mining, pp. Applications of Usage Patterns from Web Data. 51-58, 2001. SIGKDD Explorations, vol. 1, no. 2, pp. 12-23, 2000. S.E. Jespersen, J. Thorhauge, and T. Bach, “A Hybrid Approach to Web Usage Mining, Data  Kirkpatrick, S., C. D. Gelatt Jr., M. P. Vecchi, Warehousing and Knowledge Discovery”, in Optimization by Simulated Annealing, Science, 220, Y. Kambayashi, W. Winiwarter, M. Arikawa , eds., 4598, 671-680, 1983. LNCS 2454, pp. 73-82, 2002.  G. Paun, Computing with membranes , Journal of K.P. Joshi, A. Joshi, Y. Yesha, and R. Computer and System Sciences, 61 (1), 108-143, Krishnapuram, “Warehousing and Mining Web 2000. Logs”, Proceedings of the 2nd ACM CIKM Workshop on Web Information and Data  Deutsch, D., Quantum Theory, the Church-Turing Management, pp. 63-68, 1999. Principle, and the Universal Quantum Computer". Proc. Roy. Soc. Lond. A400, 97–117, 1985. R. Kosala, and H. Blockeel, Web Mining Research: A Survey, ACM SIGKDD Explorations, 2(1), pp. 1-  A. Abraham, Intelligent Systems: Architectures and 15, 2000. Perspectives, Recent Advances in Intelligent
Paradigms and Applications, Abraham A., Jain L. in GENOCOP. Proceedings of the Fourth Annual and Kacprzyk J. (Eds.), Studies in Fuzziness and Conference on Evolutionary Programming. MIT Soft Computing, Springer Verlag Germany, ISBN Press, Cambridge, pp. 289-305, 1995. 3790815381, Chapter 1, pp. 1-35, 2002.  C. Adami, Introduction to Artificial Life. Springer- K.P. Joshi, A. Joshi and Y. Yesha, On using a Verlag New York, Inc., 1998. warehouse to analyze web logs, Distributed and Parallel Databases, 13 (2), pp. 161–180, 2003. L.D. Catledge and J.E. Pitkow, Characterizing browsing strategies in the World-Wide Web, Computer Networks and ISDN Systems 27 (6), pp. 1065–1073, 1995. F.M. Facca and P.L. Lanzi, Mining interesting knowledge from weblogs: a survey, Data & Knowledge Engineering, Volume 53, Issue 3 , pp. 225-241, 2005. N. Holden and A.A. Freitas. Web page classification with an ant colony algorithm. Proc. Parallel Problem Solving from Nature (PPSN-2004), LNCS 3242, pp. 1092-1102. Springer, 2004. Bishop C.M., Neural Networks for Pattern Recognition, Oxford University Press, Oxford, UK, 1995. Fogel, D. B., Evolutionary Computation: Toward a New Philosophy of Machine Intelligence. IEEE Press, Piscataway, NJ, Second edition, 1999. Kennedy J. and Eberhart R. Swarm intelligence. Morgan Kaufmann Publishers, Inc., San Francisco, CA, 2001. Passino, K.M., Biomimicry of Bacterial Foraging for Distributed Optimization and Control, IEEE Control Systems Magazine, pp. 52-67, June 2002. de Castro, L. N. and Timmis, J. I., Artificial Immune Systems: A New Computational Intelligence Approach, Springer-Verlag, London, 2002. Amos M., Theoretical and Experimental DNA Computation. Springer, ISBN: 3-540-65773-8, 2005. Zadeh L.A. and Kacprzyk J. (Eds.) Computing with Words in Information/Intelligent Systems: Foundations, Studies in Fuzziness and Soft Computing, Springer Verlag, Germany, ISBN 379081217X, 1999. Reynolds R.G., Michalewicz, Z. Cavaretta M.J., Using Cultural Algorithms for Constraint Handling