Data Mining Use for Learning Process Design of an Information Source Locator Agent
|
|
- Holly Robertson
- 5 years ago
- Views:
Transcription
1 Data Mining Use for Learning Process Design of an Information Source Locator Agent Christian Böhm, María Rosa Galli and Omar Chiotti GIDSATD-UTN- Facultad Regional Santa Fe, Lavaise Santa Fe- Argentina INGAR - CONICET, Avellaneda Santa Fe - Argentina chiotti@ceride.gov.ar, mrgalli@ceride.gov.ar Abstract The aim of this wor is to present a data mining application to software engineering. We describe the use of data mining in some parts of the design process of a dynamic decision support system agent-based architecture. The main function of this system is to guide information requirements from users to the domains that offer greater possibilities of answering them. For that purpose, a strategy is developed, which provides the system with capacity for analyzing an information requirement, and determining to which domains it will be directed. To learn from errors made during its operation, a learning mechanism based in CBR techniques is also proposed. On the one hand, by using data mining techniques it is possible to define a discriminating function to classify the system domains into two groups: those that can probably provide an answer to the information requirement made to the system, and those that cannot. On the other hand, the application of data mining to the cases base allows the specification of rules to settle relationships among the stored cases with the aim of inferring possible causes of error in the domains classification. In this way, a learning mechanism is designed to update the nowledge base and thus improve the already made classification as regards the values assigned to the discriminating function. Keywords: Data mining, learning process, DSS, Cases base
2 Data Mining Use for Learning Process Design of an Information Source Locator Agent 1. Introduction The enterprise management involves maing many different decisions. An enterprise can be generally considered as being organized in several domains. Many of these enterprise domains, such as product design, planning, control, scheduling, forecasting and sales constitute different decision points and are generally located on different functional units geographically disperse. They use specific models and techniques to each decision type, and need to share nowledge and information. Therefore, a Decision Support System (DSS) that involves the whole organization should be designed as a set of geographically distributed subsystems (Domains), operating with the smallest level of possible joining, which we will call distributed Decision Support System (Figure 1). Forecasting Control Planning Product Design Sales Scheduling Figure 1: Distributed Decision Support System Domains There are two inds of information needs: the one that can be predicted on design time and the one that can not (this occurs whenever new or non-habitual decisions should be made). To bring support to the first type of information requirement, several enterprise integration systems have been designed (Shen and Norrie, 1999). To attend the second type of information requirement, we are developing a multi-agent system that we call dynamic DSS (Cabral et al., 2000). A dynamic DSS is a distributed DSS able to wor in a dynamic way. That is, a system able to loo for information, analyzing where it is available or can be generated. This system is composed by Domain Representative Agents (DRAs); an Information Source Locator Agent (ISLA) and mobile agents called Query Coordinator Agents (QCAs) (Figure 2). When a user of the system needs some information, maes a query in natural language and the dynamic DSS transfers that information requirement to a domain that can satisfy it. For that purpose, the system determines the sites that offer a greater possibility of providing the required information and those are firstly targeted. Then, when it gets the answer from a domain, it taes this information to the domain that ased for it.
3 DRA DRA Query Domain 2 Domain 1 Query Raned Domains Query Query QCA User Feedbac ISLA Figure 2: Multi-agent architecture for the dynamic DSS The component in charge of doing such a determination is the ISLA. This agent has nowledge about the information that can be provided by domains and the capacity for updating that nowledge, learning from cases that result from its operation. The main function of this agent is to deliver every query to a domain capable of answering it, avoiding the overload of the system sending the queries to all the domains (Figure 3). Domain Query ISLA Query/ Domain 1 Domain2 Domain n Domains with potential to answer Figure 3: The main function of ISLA Dingsoyr (1998) presents several possible uses of data mining and case-based reasoning. He classifies these uses into two groups: data mining in case-based reasoning, and case-based reasoning in data mining. He setches the following possible uses: Data mining search is the case. That is, the information about the search results and the whole nowledge discovery in database process might be stored in a case so that extra time will not be spent on mining the same information more than once. Rodriguez et al. (2000) presented a heterogeneous architecture for nowledge extraction from data. The architecture combines the nowledge discovery in database process with a case-based reasoning system intended to record the successful nowledge extraction experiments to be shared later on. Case-based reasoning provides information that can be used in providing some bacground nowledge about features in a database (for instance the weight of features for a classifier can be learned). Find features from cases base for a case to classify the cases in the cases base. This might speed up the computation of similarity metrics in the retrieve step. Find features from a database for a case to supplement the information given in it.
4 Find domain nowledge by mining a database or a cases base in the form of functions, rules or causal graphs which can be later used to identify features and explain away unimportant features. Construct artificial cases from a database that are not present in a cases base. This would require a tight integration where the data mining algorithm would search for patterns in the form of cases, which could be evaluated by a novelty function that gives high values to cases not present in the cases base. Ruiz et al. (2001) describe a project of data mining application on software engineering. Specifically, they propose to simulate the designed system to generate cases. Such cases are mined to detect possible behavioral patterns of the design. It is necessary to highlight that data mining and case-based reasoning applications on system design offers a still little developed potential. On the other hand, in designing an information system it is possible that several of the alternatives setched by Dingsoyr (1998) are simultaneously used. The aim of this wor is to describe the usage of data mining to design the learning process of the ISLA. That is, to define the data structure of the system cases base and the rules of relationships among cases. This paper is structured as follows. In section 2 a view into the system functionality is presented. Then, in section 3, it is showed how the use of data mining allows designing the learning process of the ISLA. Finally, three rules obtained by the mining process, which can be used to develop the system learning process, are presented as example. 2. A brief view into the system functionality To understand the learning process design, more nowledge about the system functionality is needed. The query: when a decision maer needs information, he/she can mae a query in natural language with the help of a user interface. This query, in order to be processed by the ISLA is filtered becoming a set of eywords without connectors, articles, prepositions, etc. q={eyword 1, eyword 2... eyword n } The Domain Knowledge Base: the ISLA has a representation of the information managed by the domain d j. Kd j ={( eyword, weight)/ 0 weight 1} where eyword is one of the words that identify the nowledge managed by domain d j, and weight is the strength that such a word represents this nowledge. The set of eywords in Kd j defines a taxonomy of domain d j. This information must be updated by both increasing/decreasing weights or adding/removing eywords from the Kd j, with the aim to adapt the ISLA to its environment changes (Stegmayer et al., 2001)
5 The Discriminant function (RSV): let D be the set of all domains being part of the system. Given an information requirement q i, this function must define the subset of domains D P D, which have the potential for answering the information requirement. Then, for each information requirement q i there will be a set of domains D P that have the potential for providing the required information, and a set of domains D N that are not able to provide the required information. In this way, the process can be seen as a domains classification into: domains with potential for providing the required information and domains without it. To carry out such a classification, a discriminating analysis can be employed (Kachigan, 1991). We define the discriminating function with a qualitative criterion variable defined by the classification labels [Potential domain] and [Non potential domain] RSV (d j,q i )= w 1 p w p w n p n where RSV is the resulting domain s discriminating score. Each domain (object) d j D will have a value on this discriminating function depending upon its values on the predicting variables p 1,... p,... p n. Every predicting variable is related to a eyword in Kd j, and it is 1 if such a eyword belongs to the query, otherwise it is 0 and w are the weights associated to each eyword in Kd j. The criterion variable is qualitative, and thus it will be necessary to define a cutoff score. The cutoff score will be equal to or greater than zero. Domains with RSV equal to or greater than the cutoff score are assigned to the D P criterion set, and domains with a RSV lower than the cutoff score are assigned to the D N criterion group. On the other hand, given an information requirement q i, the RSV value of each domain classified into the D P criterion set can be used to ran these domains. That is, the domain d j D P with the greatest RSV will be raned first, the domain d j D P with the second greatest RSV will be raned second, and so forth. Figure 4 shows an schematic representation of the main steps carried out by the DSS to bring support to a decision maer. Note that the learning functionality is still missing. Classification errors may affect the system efficiency and thus other domains d j whose RSV(d j,q i )>cutoff scores are assigned to the D P criterion set. In fact, this classification error only affects the system efficiency when RSV(d j, q i ) > RSV(d R, q i ). In that case, domain d R D P but it does not have the first place in the raning. Classification errors of the discriminating function may be due to two main causes: - The value of weights w is not the right one. - Not all eywords (predicting variables) characterizing the domain are included. It is necessary to highlight that these errors can be originated by the evolution of domains that could tae place as time goes by. Then, it will be necessary to update the system nowledge base to avoid these errors. This updating can be carried out by analyzing the results of all those cases in which there were classification errors. In other words, domain d R that answered to the respective query q i did not have the greatest RSV(d R, q i ) and therefore it was not raned first. This process can be defined as a learning process that must be structured so that it can be automatically
6 developed by the system. In the following section, we describe the use of data mining for designing the learning process. ISLA Query Domain Domain Representation (KB) Discriminant Function (RSV) Domain 1 Raning QCA Query/ Domain 2 Raned Domains Domain n Figure 4: Main steps carried out by the DSS to bring support to a decision maer 3. Use of Data Mining in Designing the Learning Process The aim of the learning process is to attain the agent autonomy. That is to say, that the agent be able to adapt itself to the environment changes. An agent will be autonomous when its behavior is defined by its experience (Russell and Norvig, 1995). So, the learning process of the ISLA conceptually consists of analyzing the data of stored cases (feedbac from the answering domains) to apply rules that allow updating the discriminating function of the system domains, which, as it was previously indicated, conform the system nowledge base. The first step in designing the learning process is to design a cases-base in which the data of queries and their respective results are stored and in which we would be able to use data mining techniques to infer rules for the learning process. Figure 5 shows an schematic representation of the learning process. Conventional data mining processes are carried out on a data base whose structure was designed without taing into account such a process. For this reason, these processes at their initial stages involve tass such as selection, preprocessing, transformation, etc. that are needed to generate a convenient data structure to be analyzed. A way of simplifying the mining process is to tae into account these tass while designing the data structure to store cases in the cases base.
7 ISLA Case-Base Case (feedbac from a domain) Data mining new Rules to apply Domain Representation (Kd) Figure 5: Schematic representation of the learning process Table I presents a logical structure of data in the cases base that allows observing a domain s behavior before the various queries. This structure will store, for a given domain d j, all queries q i, for which RSV(d j, q i ) > cutoff score. Essentially, this data structure uses binary fields to represent the relationship between a query q i, which is defined by the set of eywords Kq i, and the domain taxonomy Kd j. Table I: Logical structure of data for the domain d j. The first field, Query, stores the name that identifies each query q i. The second field, called VA, stores the qualitative variable value va(d j, q i ) that can tae [Positive, Negative, Null] values. The Positive value indicates that the required information q i was provided by the consulted domain d j. The Negative value indicates that the consulted domain d j answered to the information query q i in a negative way and the Null value indicates that domain d j did not provide any answer to query q i. According to what has been described in previous sections, in order to determine possible errors in the classification efficiency, it does not matter the RSV(d j, q i ) value itself, but the relative position of each domain d j D P. Therefore, the third field (Order) stores the order that domain obtained in the raning of domains classified as potential to answer to the query q i. The remaining
8 fields are divided into two groups: In the first group, each field represents a eyword of the domain taxonomy. Each field is designated with a eyword p Kd j, and represents a binary variable p that taes 1 as value if the eyword p of the domain taxonomy is in the query q i, and taes 0 as value if p is not stated in that query. p 1 = 0 if if p Kd p Kd j j p Kqi p Kq i In the second group, each field represents a eyword stated in query q i that does not belong to the domain taxonomy. Each of these fields is designated with a eyword p and represents a binary variable p that taes 1 as value if the eyword p is stated in the query q i but does not belong to the domain taxonomy d j, and taes 0 as value if p is not in that query. p' 1 = 0 if if p' Kd p' Kd j j p' Kqi p' Kq i We have a structure for each system domain. Each structure stores the way in which the domain behaved for the different queries for which it has been classified as potential. needs. In the following section, we will see how this logical data structure meets the posed learning 3.1. Inferring New Rules with Data Mining Once the logical data structure is designed and the cases are stored, the latter must be analyzed using data mining. The object is to analyze the data ept in the cases base so as to identify relationships among the data from which possible behavior patterns of cases can be defined. Such patterns are used to define rules for updating the discriminating function of each domain, which is stored in the nowledge base. This requires woring with the cases data associated with the involved domain. For this purpose, the logical data structure presented in Table I of the previous section will be used. According to what has been discussed, the updating can be performed in two ways: either updating the weights of the eywords (predicting variables) that define the domain taxonomy or modifying the domain taxonomy by adding new eywords Patterns Discovery Once a significant number of cases q i are stored, we can perform a mining of these data to loo for patterns. For that purpose, we define Q dj as the set of stored cases q i associated to d j. That is, Q dj = {q i / RSV(d j, q i ) > cutoff score}. To start with, cases q i Q dj are classified into four groups. A first group formed by cases in which no classification error occurred. A second group of cases in which the domain provided a positive answer but it was not the first one in the raning of potential domains. These are cases in which the classification error affected the system efficiency. A third group of cases, in which the domain provided a negative answer, and finally a fourth group of cases in which the query was not answered. To carry out this classification, va(d j,q i ) and or(d j,q i ) are defined as predicting variables.
9 Group of efficient cases Q + dj: integrated by those cases that present va(d j,q i ) = positive and or(d j,q i ) =1 Q + dj = {q i Q dj / va(d j,q i ) =positive or(d j,q i ) =1} Group of non-efficient cases Q * dj: integrated by those cases that present va(d j,q i ) = positive but or(d j,q i ) >1 Q * dj = {q i Q dj / va(d j,q i )=positive or(d j,q i ) >1} Group of negative cases Q - dj: integrated by those cases that were answered in a negative way. Q - dj = {q i Q dj / va(d j,q i ) =negative} Group of Null cases Q 0 dj: integrated by those cases in which an answer was not provided. Q 0 dj = {q i Q dj / va(d j,q i ) =null} Once q i Q dj cases are classified into one of the four defined groups, the purpose is to infer rules to update the discriminating function of each domain, which is stored in the nowledge base. The action of this rules will be: - Modifying the cases belonging to Q + dj to the lowest extent. - Determining the weights w p of the eywords (variables) of the domain taxonomy. These weights must be increased in order to correct the classification error produced in the cases of group Q * dj. These rules will operate on eywords p Kd j that are frequently present in queries q i Q * dj, since it can be inferred that these predicting variables are more important to classify domains than what their associated weights really reflect. In other words, the current weight factors w p are low. - Encouraging the incoming of new eywords into the domain taxonomy. This means including new predicting variables in the discriminating function of domain d j. These rules will operate on eywords p' Kd j that are frequently present in queries q i Q * dj. In other words, it is inferred that these predicting variables are important to classify domains. However, if those words are also frequently present in queries answered by most of the remaining domains, these eywords would not be useful to distinguish among domains and thus they should not be incorporated. Another possibility is that a domain presents many cases in which it answered in a negative form although appearing as better positioned in the raning than the domain that actually provided a positive answer. This means that this domain taxonomy has words whose weights are too high when compared to their importance in the domain. Therefore, there should be a rule that diminishes the weights of these words. With the aim of interpreting the relationships among variables, as example, we present three rules obtained by the mining process, which can be used to develop the system learning process: Given Q dj, to classify: Q * dj = {q i Q dj / va(d j,q i ) =positive or(d j,q i ) >1} Q - dj = {q i Q dj / va(d j,q i )=negative}. Set p Kd j
10 n * P : frequence of p in queries of Q * dj. n - P : frequence of p in queries of Q - dj. α 1 and α 2 : system parameters * np IF # Q dj > α1 > α2 n * P >> n P # Qdj THEN p is a candidate for increasing its weight w p In the condition of this rule, we are saying that a word belonging to the domain taxonomy is a candidate for increasing its weight if: a) more than α 1 cases are stored in Q dj and b) the number of times in which p is stated in queries of Q * dj is greater than α 2 and c) n p * is much higher than n p - Now, we present the rule for the incoming of new words into the domain taxonomy. Given Q dj, to classify : Q * dj = {q i Q dj / va(d j,q i ) = positive or(d j,q i ) >1} Q - dj ={q i Q dj / va(d j,q i ) = negative } Set p Kd j n * p : frequence of p in queries of Q * dj. n - p : frequence of p in queries of Q - dj. dn p : number of domains in which p is stated or is a candidate for entering. D={d 1,d 2,...,d n } set of system domains * np IF # Q dj > α3 > α4 n * p >> n p # Qdj THEN p is a candidate for entering Kd j p can enter Kd j if it is not a candidate for entering the taxonomy of several domains and/or it does not belong to the taxonomy of several domains dn p 0 p can be used to discriminate the domains, to which it is a candidate, from the # D remaining domains. Then, p must enter the taxonomy of domains to which it is a candidate. dn p 1 p can not be used to discriminate, then it can be included as stopword. # D In the first condition of this rule, we say that a word is a candidate for entering a Kd j if: a) more than α 3 cases are stored in Q dj and b) the proportion between the number of times in which p is stated in queries of Q * dj with respect to the number of cases stored in Q dj is greater than α 4. c) n p * much higher than n p -.
11 A word can enter Kd j if the amount of domains in the system is much higher than the quantity of domains in which p is stated or is a candidate. Set d R the domain that positively answer the query, Q + dj = {q i Q dj / va(d j,q i ) =positive or(d j,q i ) =1} Q * dj = {q i Q dj / va(d j,q i ) =positive or(d j,q i ) >1} Q - dj = {q i Q dj / va(d j,q i ) =negative} Q^dj = {q i Q - dj /or(d j,q i )<or(d R,q i ) } Q^dj set of cases of domains that bring a negative answer to the query q i and are best raned than d R Set p Kd j. n P + : frequence of p in queries of Q + dj. n P * : frequence of p in queries of Q * dj. n P^: frequence of p in queries of Q^dj. ^ np ^ * IF # Q dj > α5 >α6 n P >> n + P + np # Qdj THEN p is a candidate for diminishing its weight In the condition of this rule, we are saying that a word p is a candidate for diminishing its weight if: a) more than α 5 cases are stored in Q dj and b) the proportion of the number of times in which p is stored in queries of Q dj in respect to the number of stored cases Q dj is greater than α 6 and c) n p is much greater than the number of times in which p is stated in queries with positive answer (n p + + n p * ) 4. Conclusions A dynamic DSS that wors efficiently, i.e., that does not constantly interrupt users with information requirements they cannot satisfy, must be able to identify the relationship among the characteristics of consults and domains. By using data mining techniques it was possible to define a discriminating function to classify the system domains into two groups: those that can probably provide an answer to the information requirement made to the system, and those that cannot. The system needs to learn from the errors it could mae during its operation so that it can tend to diminish the number of consulted domains in each information requirement presented to the system. The use of data mining allowed to define the data structure that is convenient for analyzing the system operation results and according to that, designing a cases base to store the information associated with the quality of each performed search. Moreover, the application of data mining to the cases base allowed the specification of rules to settle relationships among the stored cases with the aim of inferring possible causes of error in the domains classification. In this way, a learning mechanism was designed to update the nowledge base and thus improve the already made classification as regards the values assigned to the discriminating function.
12 References Cabral, L., Caliusco, M., Nissio, H., Villarreal, M., Galli, P., Taverna,M. & Chiotti, O. (2000). Use of Agents Technology to Support Distributed Decision Processes, in Proceedings of the First World Conference on Production and Operations Management, POM Sevilla Sevilla, Spain, August Dingsoyr, T. (1998), Integration of Data Mining and Case-Based Reasoning. Accessible online at: < Jennings, N. (2001). An Agent-Based Approach for Building Complex Software Systems. Communications of the ACM, 44 (4), Kachigan, S. K. (1991). Multivariable Statistical Analysis. A conceptual introduction. New Yor: Radius Press. Rodriguez, F., Ramos, C., & Henriques, P. (2000). A case based reasoning framewor to extract nowledge from data, in Data Mining II, N. Ebecen & C.A. Brebbia (Eds.) Southampton, Boston, WITpress. Ruiz, C., Fisler, K. & Cole, Ch., KDDRG Data Mining for Software Engineering. Accessible online at: < > Rus, D., Gray, R. & Kots, D. (1998). Transportable Information Agents. In Reading in Agents,Michael Huhns & Munidar Singh boo,. Russell, S.J. and Norvig, P. (1995). Artificial Intelligence. A Modern Approach. Prentice Hall, Englewood Cliffs, NJ. Shen, W.,& Norrie, D.H. (1999). Agent-Based Systems for Intelligent Manufacturing: A Sate-ofthe-Art Survey. Knowledge and Information Systems, 1 (2), Stegmayer, G., Taverna, M.L., Chiotti, O., & Galli, M.R. (2001). The Agent Routering Process of Dynamic Distributed Decision Support System. Journal of Computer Science & Technology, 2 (5), Accessible online at: <
SUPPORT SYSTEM FOR PROCESS FLOW SCHEDULING
SUPPORT SYSTEM FOR PROCESS FLOW SCHEDULING Juan Lerch, Enrique Salomone and Omar Chiotti GIDSATD UTN FRSF, Lavaisse 610, 3000 Santa Fe - Argentina INGAR CONICET, Avellaneda 3657, 3000 Santa Fe Argentina
Architecture of a Mobile-Agent of a Distributed Knowledge Management System
Architecture of a Mobile-Agent of a Distributed Knowledge Management System Esteban Bailone 1, Pablo Villarreal 1, María Rosa Galli 1,2, Omar Chiotti 1,2 1 GIDSATD Universidad Tecnológica Nacional Facultad
Transforming Collaborative Process Models into Interface Process Models by Applying an MDA Approach
Transforming Collaborative Process Models into Interface Process Models by Applying an MDA Approach Ivanna M. Lazarte 1, Omar Chiotti 1, 2 and Pablo D. Villarreal 1 1 CIDISI, Universidad Tecnológica Nacional-FRSF,
Combination of Markov and MultiDamping Techniques for Web Page Ranking Sandeep Nagpure, Student,RKDFIST,Bhopal, Prof. Srikant Lade, RKDFIST,Bhopal
www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume 3 Issue 9 September, 2014 Page No. 8341-8346 Combination of Marov and MultiDamping Techniques for Web Page Raning
A Novel Texture Classification Procedure by using Association Rules
ITB J. ICT Vol. 2, No. 2, 2008, 03-4 03 A Novel Texture Classification Procedure by using Association Rules L. Jaba Sheela & V.Shanthi 2 Panimalar Engineering College, Chennai. 2 St.Joseph s Engineering
Automated Clustering-Based Workload Characterization
Automated Clustering-Based Worload Characterization Odysseas I. Pentaalos Daniel A. MenascŽ Yelena Yesha Code 930.5 Dept. of CS Dept. of EE and CS NASA GSFC Greenbelt MD 2077 George Mason University Fairfax
Information Agents for Competitive Market Monitoring in Production Chains
Agents for Competitive Market Monitoring in Production Chains Gerhard Schiefer and Melanie Fritz University of Bonn, Business and Management e-mail: schiefer@uni-bonn.de m.fritz@uni-bonn.de Abstract The
TIM 50 - Business Information Systems
TIM 50 - Business Information Systems Lecture 15 UC Santa Cruz Nov 10, 2016 Class Announcements n Database Assignment 2 posted n Due 11/22 The Database Approach to Data Management The Final Database Design
A Survey on k-means Clustering Algorithm Using Different Ranking Methods in Data Mining
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 2, Issue. 4, April 2013,
A Hybrid Recommender System for Dynamic Web Users
A Hybrid Recommender System for Dynamic Web Users Shiva Nadi Department of Computer Engineering, Islamic Azad University of Najafabad Isfahan, Iran Mohammad Hossein Saraee Department of Electrical and
SEEKING THE ACTUAL REASONS FOR THE "NEW PARADIGM" IN THE AREA OF IS ANALYSIS 2. GENERAL CHARACTERISTICS OF THE "STRUCTURED APPROACH" IN IS DEVELOPMENT
SEEKING THE ACTUAL REASONS FOR THE "NEW PARADIGM" IN THE AREA OF IS ANALYSIS Václav Řepa Prague University of Economics, W.Churchill sq. 4, 130 00 Praha 3, Czech Republic E-mail: REPA@VSE.CZ 1. INTRODUCTION
Automated Online News Classification with Personalization
Automated Online News Classification with Personalization Chee-Hong Chan Aixin Sun Ee-Peng Lim Center for Advanced Information Systems, Nanyang Technological University Nanyang Avenue, Singapore, 639798
A Systems Approach to Dimensional Modeling in Data Marts. Joseph M. Firestone, Ph.D. White Paper No. One. March 12, 1997
1 of 8 5/24/02 4:43 PM A Systems Approach to Dimensional Modeling in Data Marts By Joseph M. Firestone, Ph.D. White Paper No. One March 12, 1997 OLAP s Purposes And Dimensional Data Modeling Dimensional
Hotel Recommendation Based on Hybrid Model
Hotel Recommendation Based on Hybrid Model Jing WANG, Jiajun SUN, Zhendong LIN Abstract: This project develops a hybrid model that combines content-based with collaborative filtering (CF) for hotel recommendation.
OPTIMIZING PRODUCTION WORK FLOW USING OPEMCSS. John R. Clymer
Proceedings of the 2000 Winter Simulation Conference J. A. Joines, R. R. Barton, K. Kang, and P. A. Fishwick, eds. OPTIMIZING PRODUCTION WORK FLOW USING OPEMCSS John R. Clymer Applied Research Center for
A Survey on Postive and Unlabelled Learning
A Survey on Postive and Unlabelled Learning Gang Li Computer & Information Sciences University of Delaware ligang@udel.edu Abstract In this paper we survey the main algorithms used in positive and unlabeled
A New Technique to Optimize User s Browsing Session using Data Mining
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 4, Issue. 3, March 2015,
CLOSED LOOP SYSTEM IDENTIFICATION USING GENETIC ALGORITHM
CLOSED LOOP SYSTEM IDENTIFICATION USING GENETIC ALGORITHM Lucchesi Alejandro (a), Campomar Guillermo (b), Zanini Aníbal (c) (a,b) Facultad Regional San Nicolás Universidad Tecnológica Nacional (FRSN-UTN),
An Intelligent Clustering Algorithm for High Dimensional and Highly Overlapped Photo-Thermal Infrared Imaging Data
An Intelligent Clustering Algorithm for High Dimensional and Highly Overlapped Photo-Thermal Infrared Imaging Data Nian Zhang and Lara Thompson Department of Electrical and Computer Engineering, University
The Comparison of CBA Algorithm and CBS Algorithm for Meteorological Data Classification Mohammad Iqbal, Imam Mukhlash, Hanim Maria Astuti
Information Systems International Conference (ISICO), 2 4 December 2013 The Comparison of CBA Algorithm and CBS Algorithm for Meteorological Data Classification Mohammad Iqbal, Imam Mukhlash, Hanim Maria
Generalized Social Networks. Social Networks and Ranking. How use links to improve information search? Hypertext
Generalized Social Networs Social Networs and Raning Represent relationship between entities paper cites paper html page lins to html page A supervises B directed graph A and B are friends papers share
Yunfeng Zhang 1, Huan Wang 2, Jie Zhu 1 1 Computer Science & Engineering Department, North China Institute of Aerospace
[Type text] [Type text] [Type text] ISSN : 0974-7435 Volume 10 Issue 20 BioTechnology 2014 An Indian Journal FULL PAPER BTAIJ, 10(20), 2014 [12526-12531] Exploration on the data mining system construction
Comment Extraction from Blog Posts and Its Applications to Opinion Mining
Comment Extraction from Blog Posts and Its Applications to Opinion Mining Huan-An Kao, Hsin-Hsi Chen Department of Computer Science and Information Engineering National Taiwan University, Taipei, Taiwan
INTELLIGENT SYSTEMS OVER THE INTERNET
INTELLIGENT SYSTEMS OVER THE INTERNET Web-Based Intelligent Systems Intelligent systems use a Web-based architecture and friendly user interface Web-based intelligent systems: Use the Web as a platform
Rapid Simultaneous Learning of Multiple Behaviours with a Mobile Robot
Rapid Simultaneous Learning of Multiple Behaviours with a Mobile Robot Koren Ward School of Information Technology and Computer Science University of Wollongong koren@uow.edu.au www.uow.edu.au/~koren Abstract
2. (a) Briefly discuss the forms of Data preprocessing with neat diagram. (b) Explain about concept hierarchy generation for categorical data.
Code No: M0502/R05 Set No. 1 1. (a) Explain data mining as a step in the process of knowledge discovery. (b) Differentiate operational database systems and data warehousing. [8+8] 2. (a) Briefly discuss
Horizontal Aggregations in SQL to Prepare Data Sets Using PIVOT Operator
Horizontal Aggregations in SQL to Prepare Data Sets Using PIVOT Operator R.Saravanan 1, J.Sivapriya 2, M.Shahidha 3 1 Assisstant Professor, Department of IT,SMVEC, Puducherry, India 2,3 UG student, Department
Collaborative Filtering using a Spreading Activation Approach
Collaborative Filtering using a Spreading Activation Approach Josephine Griffith *, Colm O Riordan *, Humphrey Sorensen ** * Department of Information Technology, NUI, Galway ** Computer Science Department,
E-R Model. Hi! Here in this lecture we are going to discuss about the E-R Model.
E-R Model Hi! Here in this lecture we are going to discuss about the E-R Model. What is Entity-Relationship Model? The entity-relationship model is useful because, as we will soon see, it facilitates communication
SALVO-a fourth-generation language for personal computers
SALVO-a fourth-generation language for personal computers by MARVIN ELDER Software Automation, Inc. Dallas, Texas ABSTRACT Personal computer users are generally nontechnical people. Fourth-generation products
Ontology-Based Web Query Classification for Research Paper Searching
Ontology-Based Web Query Classification for Research Paper Searching MyoMyo ThanNaing University of Technology(Yatanarpon Cyber City) Mandalay,Myanmar Abstract- In web search engines, the retrieval of
SCALABLE KNOWLEDGE BASED AGGREGATION OF COLLECTIVE BEHAVIOR
SCALABLE KNOWLEDGE BASED AGGREGATION OF COLLECTIVE BEHAVIOR P.SHENBAGAVALLI M.E., Research Scholar, Assistant professor/cse MPNMJ Engineering college Sspshenba2@gmail.com J.SARAVANAKUMAR B.Tech(IT)., PG
Minimum Time Point Assignment for Coverage by Two Constrained Robots
2008 IEEE International Conference on Robotics and Automation Pasadena, CA, USA, May 19-23, 2008 Minimum Time Point Assignment for Coverage by Two Constrained Robots Nilanjan Charaborty Rensselaer Polytechnic
Domain Specific Search Engine for Students
Domain Specific Search Engine for Students Domain Specific Search Engine for Students Wai Yuen Tang The Department of Computer Science City University of Hong Kong, Hong Kong wytang@cs.cityu.edu.hk Lam
A New Approach For Convert Multiply-Connected Trees in Bayesian networks
A New Approach For Convert Multiply-Connected Trees in Bayesian networks 1 Hussein Baloochian, Alireza khantimoory, 2 Saeed Balochian 1 Islamic Azad university branch of zanjan 2 Islamic Azad university
Web Data mining-a Research area in Web usage mining
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661, p- ISSN: 2278-8727Volume 13, Issue 1 (Jul. - Aug. 2013), PP 22-26 Web Data mining-a Research area in Web usage mining 1 V.S.Thiyagarajan,
A Technical Analysis of Market Basket by using Association Rule Mining and Apriori Algorithm
A Technical Analysis of Market Basket by using Association Rule Mining and Apriori Algorithm S.Pradeepkumar*, Mrs.C.Grace Padma** M.Phil Research Scholar, Department of Computer Science, RVS College of
Semantic Clickstream Mining
Semantic Clickstream Mining Mehrdad Jalali 1, and Norwati Mustapha 2 1 Department of Software Engineering, Mashhad Branch, Islamic Azad University, Mashhad, Iran 2 Department of Computer Science, Universiti
Semantic Object Recognition in Digital Images
Semantic Object Recognition in Digital Images Semantic Object Recognition in Digital Images Falk Schmidsberger and Frieder Stolzenburg Hochschule Harz, Friedrichstr. 57 59 38855 Wernigerode, GERMANY {fschmidsberger,fstolzenburg}@hs-harz.de
Software Design using Analogy and WordNet
Software Design using Analogy and WordNet Paulo Gomes, Francisco C. Pereira, Nuno Seco, Paulo Paiva, Paulo Carreiro, José L. Ferreira, Carlos Bento CISUC Centro de Informática e Sistemas da Universidade
Probabilistic Location Recognition using Reduced Feature Set
Probabilistic Location Recognition using Reduced Feature Set Fayin Li and Jana Košecá Department of Computer Science George Mason University, Fairfax, VA 3 Email: {fli,oseca}@cs.gmu.edu Abstract The localization
A Finite State Mobile Agent Computation Model
A Finite State Mobile Agent Computation Model Yong Liu, Congfu Xu, Zhaohui Wu, Weidong Chen, and Yunhe Pan College of Computer Science, Zhejiang University Hangzhou 310027, PR China Abstract In this paper,
Domain-specific Concept-based Information Retrieval System
Domain-specific Concept-based Information Retrieval System L. Shen 1, Y. K. Lim 1, H. T. Loh 2 1 Design Technology Institute Ltd, National University of Singapore, Singapore 2 Department of Mechanical
IMPROVING INFORMATION RETRIEVAL BASED ON QUERY CLASSIFICATION ALGORITHM
IMPROVING INFORMATION RETRIEVAL BASED ON QUERY CLASSIFICATION ALGORITHM Myomyo Thannaing 1, Ayenandar Hlaing 2 1,2 University of Technology (Yadanarpon Cyber City), near Pyin Oo Lwin, Myanmar ABSTRACT
International Journal of Computer Science Trends and Technology (IJCST) Volume 5 Issue 4, Jul Aug 2017
International Journal of Computer Science Trends and Technology (IJCST) Volume 5 Issue 4, Jul Aug 17 RESEARCH ARTICLE OPEN ACCESS Classifying Brain Dataset Using Classification Based Association Rules
TERM BASED WEIGHT MEASURE FOR INFORMATION FILTERING IN SEARCH ENGINES
TERM BASED WEIGHT MEASURE FOR INFORMATION FILTERING IN SEARCH ENGINES Mu. Annalakshmi Research Scholar, Department of Computer Science, Alagappa University, Karaikudi. annalakshmi_mu@yahoo.co.in Dr. A.
AGENT-BASED ROUTING ALGORITHMS ON A LAN
AGENT-BASED ROUTING ALGORITHMS ON A LAN Y. Yang, A. N. Zincir-Heywood, M. I. Heywood, S. Srinivas Faculty of Computer Science, Dalhousie University {yang@cs.dal.ca, zincir@cs.dal.ca, mheywood@cs.dal.ca,
Lina Guzman, DIRECTV
Paper 3483-2015 Data sampling improvement by developing SMOTE technique in SAS Lina Guzman, DIRECTV ABSTRACT A common problem when developing classification models is the imbalance of classes in the classification
SIMILARITY MEASURES FOR MULTI-VALUED ATTRIBUTES FOR DATABASE CLUSTERING
SIMILARITY MEASURES FOR MULTI-VALUED ATTRIBUTES FOR DATABASE CLUSTERING TAE-WAN RYU AND CHRISTOPH F. EICK Department of Computer Science, University of Houston, Houston, Texas 77204-3475 {twryu, ceick}@cs.uh.edu
Web Usage Mining: A Research Area in Web Mining
Web Usage Mining: A Research Area in Web Mining Rajni Pamnani, Pramila Chawan Department of computer technology, VJTI University, Mumbai Abstract Web usage mining is a main research area in Web mining
Point Grouping Using a Genetic Algorithm
Point Grouping Using a Genetic Algorithm Kriangsiri Malasri Senior, School of Aerospace Engineering Georgia Institute of Technology, 34054 Georgia Tech Station, Atlanta, GA 30332 Siripong Malasri Professor
Harmonization of usability measurements in ISO9126 software engineering standards
Harmonization of usability measurements in ISO9126 software engineering standards Laila Cheikhi, Alain Abran and Witold Suryn École de Technologie Supérieure, 1100 Notre-Dame Ouest, Montréal, Canada laila.cheikhi.1@ens.etsmtl.ca,
Some Thoughts on Machine Learning Software Design
Support Vector Machines 1 Some Thoughts on Machine Learning Software Design Chih-Jen Lin Department of Computer Science National Taiwan University Talk at University of Southampton, February 6, 2004 Support
CS174 Lecture 11. Routing in a Parallel Computer
CS74 Lecture Routing in a Parallel Computer We study the problem of moving pacets around in a parallel computer. In this lecture we will consider parallel computers with hypercube connection networs. The
WKU-MIS-B10 Data Management: Warehousing, Analyzing, Mining, and Visualization. Management Information Systems
Management Information Systems Management Information Systems B10. Data Management: Warehousing, Analyzing, Mining, and Visualization Code: 166137-01+02 Course: Management Information Systems Period: Spring
Automatic Learning of Predictive CEP Rules Bridging the Gap between Data Mining and Complex Event Processing
Automatic Learning of Predictive CEP Rules Bridging the Gap between Data Mining and Complex Event Processing Raef Mousheimish, Yehia Taher and Karine Zeitouni DAIVD Laboratory, University of Versailles,
TIM 50 - Business Information Systems
TIM 50 - Business Information Systems Lecture 15 UC Santa Cruz May 20, 2014 Announcements DB 2 Due Tuesday Next Week The Database Approach to Data Management Database: Collection of related files containing
Performance Based Study of Association Rule Algorithms On Voter DB
Performance Based Study of Association Rule Algorithms On Voter DB K.Padmavathi 1, R.Aruna Kirithika 2 1 Department of BCA, St.Joseph s College, Thiruvalluvar University, Cuddalore, Tamil Nadu, India,
Structure of Association Rule Classifiers: a Review
Structure of Association Rule Classifiers: a Review Koen Vanhoof Benoît Depaire Transportation Research Institute (IMOB), University Hasselt 3590 Diepenbeek, Belgium koen.vanhoof@uhasselt.be benoit.depaire@uhasselt.be
WHITE PAPER Application Performance Management. The Case for Adaptive Instrumentation in J2EE Environments
WHITE PAPER Application Performance Management The Case for Adaptive Instrumentation in J2EE Environments Why Adaptive Instrumentation?... 3 Discovering Performance Problems... 3 The adaptive approach...
Processing Interaction Protocols in Parallel: a Logic Programming implementation for Robotic Soccer
Processing Interaction Protocols in Parallel: a Logic Programming implementation for Robotic Soccer Mariano Tucat 1 Alejandro J. García 2 Artificial Intelligence Research and Development Laboratory Department
1. Inroduction to Data Mininig
1. Inroduction to Data Mininig 1.1 Introduction Universe of Data Information Technology has grown in various directions in the recent years. One natural evolutionary path has been the development of the
The Relationship between Slices and Module Cohesion
The Relationship between Slices and Module Cohesion Linda M. Ott Jeffrey J. Thuss Department of Computer Science Michigan Technological University Houghton, MI 49931 Abstract High module cohesion is often
Knowledge and Ontological Engineering: Directions for the Semantic Web
Knowledge and Ontological Engineering: Directions for the Semantic Web Dana Vaughn and David J. Russomanno Department of Electrical and Computer Engineering The University of Memphis Memphis, TN 38152
Building a Concept Hierarchy from a Distance Matrix
Building a Concept Hierarchy from a Distance Matrix Huang-Cheng Kuo 1 and Jen-Peng Huang 2 1 Department of Computer Science and Information Engineering National Chiayi University, Taiwan 600 hckuo@mail.ncyu.edu.tw
SCENARIO BASED ADAPTIVE PREPROCESSING FOR STREAM DATA USING SVM CLASSIFIER
SCENARIO BASED ADAPTIVE PREPROCESSING FOR STREAM DATA USING SVM CLASSIFIER P.Radhabai Mrs.M.Priya Packialatha Dr.G.Geetha PG Student Assistant Professor Professor Dept of Computer Science and Engg Dept
Mining Association Rules in Temporal Document Collections
Mining Association Rules in Temporal Document Collections Kjetil Nørvåg, Trond Øivind Eriksen, and Kjell-Inge Skogstad Dept. of Computer and Information Science, NTNU 7491 Trondheim, Norway Abstract. In
Lucian Blaga University of Sibiu, Faculty of Engineering, 4 E. Cioran St, 55025, Sibiu, Romania 2
Studies regarding the use of a neuro-fuzzy mathematical model in order to determine the technological parameters of the polyethylene pipes butt welding process Alina Gligor 1,*, Marcel-Letitiu Balan 2,
Collaborative Filtering based on User Trends
Collaborative Filtering based on User Trends Panagiotis Symeonidis, Alexandros Nanopoulos, Apostolos Papadopoulos, and Yannis Manolopoulos Aristotle University, Department of Informatics, Thessalonii 54124,
INTRODUCTION TO DATA MINING. Daniel Rodríguez, University of Alcalá
INTRODUCTION TO DATA MINING Daniel Rodríguez, University of Alcalá Outline Knowledge Discovery in Datasets Model Representation Types of models Supervised Unsupervised Evaluation (Acknowledgement: Jesús
Just-In-Time Hypermedia
A Journal of Software Engineering and Applications, 2013, 6, 32-36 doi:10.4236/jsea.2013.65b007 Published Online May 2013 (http://www.scirp.org/journal/jsea) Zong Chen 1, Li Zhang 2 1 School of Computer
Mobile Agent Routing for Query Retrieval Using Genetic Algorithm
1 Mobile Agent Routing for Query Retrieval Using Genetic Algorithm A. Selamat a, b, M. H. Selamat a and S. Omatu b a Faculty of Computer Science and Information Systems, Universiti Teknologi Malaysia,
Collaborative Framework for Testing Web Application Vulnerabilities Using STOWS
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology ISSN 2320 088X IMPACT FACTOR: 5.258 IJCSMC,
Usability Inspection Report of NCSTRL
Usability Inspection Report of NCSTRL (Networked Computer Science Technical Report Library) www.ncstrl.org NSDL Evaluation Project - Related to efforts at Virginia Tech Dr. H. Rex Hartson Priya Shivakumar
IJREAT International Journal of Research in Engineering & Advanced Technology, Volume 1, Issue 5, Oct-Nov, ISSN:
IJREAT International Journal of Research in Engineering & Advanced Technology, Volume 1, Issue 5, Oct-Nov, 20131 Improve Search Engine Relevance with Filter session Addlin Shinney R 1, Saravana Kumar T
Automatic Discovery of Association Orders between Name and Aliases from the Web using Anchor Texts-based Co-occurrences
Automatic Discovery of Association Orders between Name and Aliases from the Web using Anchor Texts-based Co-occurrences Rama Subbu Lashmi B Department of Computer Science and Engineering Sri Venateswara
MULTIDIMENSIONAL INDEXING TREE STRUCTURE FOR SPATIAL DATABASE MANAGEMENT
MULTIDIMENSIONAL INDEXING TREE STRUCTURE FOR SPATIAL DATABASE MANAGEMENT Dr. G APPARAO 1*, Mr. A SRINIVAS 2* 1. Professor, Chairman-Board of Studies & Convener-IIIC, Department of Computer Science Engineering,
EVALUATIONS OF THE EFFECTIVENESS OF ANOMALY BASED INTRUSION DETECTION SYSTEMS BASED ON AN ADAPTIVE KNN ALGORITHM
EVALUATIONS OF THE EFFECTIVENESS OF ANOMALY BASED INTRUSION DETECTION SYSTEMS BASED ON AN ADAPTIVE KNN ALGORITHM Assosiate professor, PhD Evgeniya Nikolova, BFU Assosiate professor, PhD Veselina Jecheva,
A MULTI-DIMENSIONAL DATA ORGANIZATION THAT ASSISTS IN THE PARSING AND PRODUCTION OF A SENTENCE
A MULTI-DIMENSIONAL DATA ORGANIZATION THAT ASSISTS IN THE PARSING AND PRODUCTION OF A SENTENCE W. Faris and K. Cheng Department of Computer Science University of Houston Houston, TX, 77204, USA http://www.cs.uh.edu
A Reliable Seamless Handoff Scheme based Wireless Networks using TOPSIS and WPM Methods
A Reliable Seamless Handoff Scheme based Wireless Networks using TOPSIS and WPM Methods T. Ajith M.Phil Research Scholar tajith1995@gmail.com K. Sivakumar Ph.D Research Scholar Siva.phd.199@gmail.com Dr.
Application of Improved Lzc Algorithm in the Discrimination of Photo and Text ChengJing Ye 1, a, Donghai Zeng 2,b
2016 International Conference on Information Engineering and Communications Technology (IECT 2016) ISBN: 978-1-60595-375-5 Application of Improved Lzc Algorithm in the Discrimination of Photo and Text
Correlation Based Feature Selection with Irrelevant Feature Removal
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 4, April 2014,
International Journal Of Engineering And Computer Science ISSN: Volume 5 Issue 11 Nov. 2016, Page No.
www.ijecs.in International Journal Of Engineering And Computer Science ISSN: 2319-7242 Volume 5 Issue 11 Nov. 2016, Page No. 19054-19062 Review on K-Mode Clustering Antara Prakash, Simran Kalera, Archisha
Analysis of the Social Community Based on the Network Growing Model in Open Source Software Community
Analysis of the Social Community Based on the Networ Growing Model in Open Source Software Community arxiv:8.8v [cs.ma] 9 Apr 8 Taumi Ichimura Department of Management and Systems, Prefectural University
A Method Based on RBF-DDA Neural Networks for Improving Novelty Detection in Time Series
Method Based on RBF-DD Neural Networks for Improving Detection in Time Series. L. I. Oliveira and F. B. L. Neto S. R. L. Meira Polytechnic School, Pernambuco University Center of Informatics, Federal University
Research on Mobile Computing based on Event Choreography Technology
International Symposium on Computers & Informatics (ISCI 2015) Research on Mobile Computing based on Event Choreography Technology Biao Dong 1, a 1Nanjing Institute of Industry Technology, Nanjing, China
Multi Agent System-Based on Case Based Reasoning for Cloud Computing System
Multi Agent System-Based on Case Based Reasoning for Cloud Computing System Amir Mohamed Talib 1 and Nour Eldin Mohamed Elshaiekh 2 1 Faculty of Computer and Information Science, Information Technology
A Modified Maximum Urgency First Scheduling Algorithm for Real-Time Tasks
Vol:, o:9, 2007 A Modified Maximum Urgency irst Scheduling Algorithm for Real-Time Tasks Vahid Salmani, Saman Taghavi Zargar, and Mahmoud aghibzadeh International Science Index, Computer and Information
Data Preprocessing. Supervised Learning
Supervised Learning Regression Given the value of an input X, the output Y belongs to the set of real values R. The goal is to predict output accurately for a new input. The predictions or outputs y are
Keywords: geolocation, recommender system, machine learning, Haversine formula, recommendations
Volume 6, Issue 4, April 2016 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Geolocation Based
Chapter 3. The Multidimensional Model: Basic Concepts. Introduction. The multidimensional model. The multidimensional model
Chapter 3 The Multidimensional Model: Basic Concepts Introduction Multidimensional Model Multidimensional concepts Star Schema Representation Conceptual modeling using ER, UML Conceptual modeling using
An Applicative, O(N * log k (N) * N(k-1)/k) Algorithm to Reconstruct Trees from Preorder Node Lists
Department of Computer Science and Engineering University of Texas at Arlington Arlington, TX 76019 An Applicative, O(N * log (N) * N(-1)/) Algorithm to Reconstruct Trees from Preorder Node Lists Arthur
Wavelet based Keyframe Extraction Method from Motion Capture Data
Wavelet based Keyframe Extraction Method from Motion Capture Data Xin Wei * Kunio Kondo ** Kei Tateno* Toshihiro Konma*** Tetsuya Shimamura * *Saitama University, Toyo University of Technology, ***Shobi
A Survey on Information Extraction in Web Searches Using Web Services
A Survey on Information Extraction in Web Searches Using Web Services Maind Neelam R., Sunita Nandgave Department of Computer Engineering, G.H.Raisoni College of Engineering and Management, wagholi, India
Query-Sensitive Similarity Measure for Content-Based Image Retrieval
Query-Sensitive Similarity Measure for Content-Based Image Retrieval Zhi-Hua Zhou Hong-Bin Dai National Laboratory for Novel Software Technology Nanjing University, Nanjing 2193, China {zhouzh, daihb}@lamda.nju.edu.cn
Sathyamangalam, 2 ( PG Scholar,Department of Computer Science and Engineering,Bannari Amman Institute of Technology, Sathyamangalam,
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661, p- ISSN: 2278-8727Volume 8, Issue 5 (Jan. - Feb. 2013), PP 70-74 Performance Analysis Of Web Page Prediction With Markov Model, Association
CS4445 Data Mining and Knowledge Discovery in Databases. A Term 2008 Exam 2 October 14, 2008
CS4445 Data Mining and Knowledge Discovery in Databases. A Term 2008 Exam 2 October 14, 2008 Prof. Carolina Ruiz Department of Computer Science Worcester Polytechnic Institute NAME: Prof. Ruiz Problem
Data Mining Final Project Francisco R. Ortega Professor: Dr. Tao Li
Data Mining Final Project Francisco R. Ortega Professor: Dr. Tao Li FALL 2009 1.Introduction In the data mining class one of the aspects of interest were classifications. For the final project, the decision
Enhanced Performance of Search Engine with Multitype Feature Co-Selection of Db-scan Clustering Algorithm
Enhanced Performance of Search Engine with Multitype Feature Co-Selection of Db-scan Clustering Algorithm K.Parimala, Assistant Professor, MCA Department, NMS.S.Vellaichamy Nadar College, Madurai, Dr.V.Palanisamy,
Multi-label classification using rule-based classifier systems
Multi-label classification using rule-based classifier systems Shabnam Nazmi (PhD candidate) Department of electrical and computer engineering North Carolina A&T state university Advisor: Dr. A. Homaifar