CUM: An Efficient Framework for Mining Concept Units

Transcription

1 CUM: An Effcent Framework for Mnng Concept Unts P.Santh Thlagam Ananthanarayana V.S Department of Informaton Technology Natonal Insttute of Technology Karnataka - Surathkal Inda santh_soc@yahoo.co.n, anvs@ntk.ac.n Abstract Web s the most mportant repostory of dfferent knds of meda such as text, sound, vdeo, mages etc. Web mnng s the process of applyng data mnng technques to automatcally dscover knowledge from such a dverse, sheer sze data so that t can be more easly browsed, organzed, and catalogued wth mnmal human nterventon. A web ste usually contans a large number of concept enttes, each consstng of one or more web pages connected by hyperlnks. A large porton of web search actvtes ams to locate a set of concept enttes relevant to the user query. The web unt mnng problem s proposed to dscover the concept enttes and classfy these concept enttes nto categores. Web page classfcaton manly assgns one or more concept labels to every web page based on ts own content wthout consderng other neghbourng web pages. The exstng teratve Web Unt Mnng (WUM) algorthms create more than one web unt (ncomplete web unts) from a sngle concept entty. In ths paper, we propose a novel non-teratve web unt mnng algorthm, Concept Unt Mnng (CUM), whch fnds the set of web pages formng each web unt, and assgns the web unt a concept label based on the structure of the web pages so as reduce the later classfcaton errors. Our experments usng the WebKB dataset show that the dsadvantage of WUM algorthms are removed and over all accuracy s sgnfcantly mproved. 1. Introducton The World Wde Web (WWW) s a popular and nteractve medum to dssemnate nformaton today. Web s radcally dfferent from structured databases n schema, volume, topc-coherence [1]. Searchng, comprehendng, and usng the sem structured nformaton stored on the web poses a sgnfcant challenge because ths data s more sophstcated and dynamc than the database systems. Web Mnng s the process of applyng data mnng technques to extract useful nformaton from varous knds of web data such as content data, structure data, and usage data. The Fgure 1 shows the taxonomy of web mnng [2]. Fgure 1: Web mnng taxonomy Internatonal Conference on Management of Data COMAD 2008, Mumba, Inda, December , 2008 Computer Socety of Inda, 2008 Descrbng and organzng ths vast amount of content s essental for realzng the web s full potental as an nformaton resource. Web Classfcaton s mportant 1

2 and ndeed essental for organzng and understandng web content. In web classfcaton research, most efforts are about classfyng ndvdual web pages from one or more web stes nto a set of at categores or categores organzed n a herarchy. Web page classfcaton and web ste classfcaton methods try to classfy the set of web pages and web stes respectvely. However, n realty, web pages from a web ste are often created together wth lnks among them and these lnks carry some semantcs that bnd a set of web pages to form a meanngful nformaton unt. Unfortunately, such an observaton has rarely been consdered by the exstng web classfcaton research. Recently, Sun and Lm [3] proposed the concept of web unt and the web unt mnng problem. Here, the web pages are grouped as unts and classfed. Web unt mnng s dfferent from web page classfcaton as t conssts of both web unt constructon and classfcaton task. Sun et. al [3] proposed teratve Web Unt Mnng (WUM) method whch carres out web unt constructon and web unt classfcaton n an teratve manner. The Iteratve method mght create more than one web unt (ncomplete web unt) from a sngle concept entty and each ncomplete web unt contans ncomplete nformaton about a concept entty. In ths paper, we propose a Concept Unt Mnng (CUM) method explots both structure and content of web stes to mprove the classfcaton accuracy. CUM s not an teratve method thus faster than the WUM method. The rest of the paper s organzed as follows. Secton 2 presents the related work. Secton 3 descrbes the overvew of the problem statement. Secton 4 and secton 5 dscuss the concept unt mnng methodology. Secton 6 presents the expermental study. Secton 7 concludes ths paper. 2. Related Work Searchng nformaton from the web contanng mllons of web pages based on certan prerequste condtons s a very complex task. Ths problem has been a focus of many researchers. Web page classfcaton and web ste classfcaton are ntroduced for ease of searchng and browsng [4,5,6]. Fgure 2 shows the taxonomy of varous exstng web classfcaton algorthms n the lterature. Z.Broder et.al [7] modeled and analyzed the web page classfcaton problem usng lnk nformaton. L.Getoor et.al [8] proposed a unfed probablstc model for both the textual content and the lnk structure of a document collecton. The model s based on the recently ntroduced framework of Probablstc Relatonal Models (PRMs) whch allows us to capture correlatons between lnked documents. M.Craven et.al [6] presented hypertext classfers that combnes a statstcal text learnng method wth a relaton rule learner. J.Furnkranz [9] ntroduced hyperlnk ensembles, a novel type of ensemble classfer for classfyng hypertext documents. H.J.Oh et.al [10] proposed a practcal hypertext categorzaton method bult on bayesan classfer model usng lnks and ncrementally avalable class nformaton. Y.Yang et.al [11] presented a study wth sgnfcant analyss on fve well known text categorzaton methods: Support Vector Machnes (SVM), K-Nearest Neghbor (knn) classfer, a Neural Network (NNet) approach, the Lnear Least Squares Ft (LLSF) mappng and a Naïve Bayes (NB) classfer. L.Terveen et.al [12] ntroduced a novel approach consderng web ste as the basc unt to analyse the web. The mportant factor complcatng the explotaton of structure s the uncertanty of the labels wthn the ste trees. Y.Tan et.al [13] adapted Hdden Markov Models (HMM) to handle the uncertanty wthn the ste classfer. Sun et.al [3] proposed a new problem called the web unt mnng problem, whch s the focus of ths paper. Fgure 2. Taxonomy of Web Classfcaton Algorthms Three methods exst n the lterature to solve the above problem of web unt mnng. They are: a) Baselne method: A straghtforward soluton s to perform web page classfcaton on web pages and group the pages together to construct web unts based on classfcaton results. In ths method, large number of web pages wll be classfed and any mstake made n web page classfcaton wll nevtably cause erroneous web unts to be constructed. b) Baselne wth fragments method: The baselne wth fragments method (denoted by baselne (fragment)) deals wth web fragments nstead of web pages. Ths method only constructs the web unts. It does not classfy the web unts. c) Iteratve Web Unt Mnng (WUM): The web unt mnng has two sub-problems, namely web unt constructon and web unt classfcaton. WUM addresses these two sub-problems n an teratve manner. It frst groups closely-related 2

3 web pages nto small unts (web fragments), whch are then classfed and merged wth one another to form large web unts. Ths classfyngmergng procedure s repeated untl there s no change of category labels assgned to the web unts. The rules of mergng allow a sngle labeled web unt to merge wth neghborng unlabeled web unts, but not labeled web unts. A labeled web unt refers to one that has been assgned a category label; otherwse t s called an unlabeled web unt. Note that those unlabeled web unts are ntermedate results of WUM. They are expected to merge wth neghborng labeled web unts n the next web unt constructon phase. When WUM stops, those remanng unlabeled web unts are dscarded, only labeled web unts are returned. In other words, web unt mnng results are all labeled web unts. Ths s shown as the mprovement over the two baselne methods. The exstence of ncomplete web unts does harmful n usng web unts to other applcatons. One mportant applcaton s to allow search engnes to ndex web nformaton at the web unt level nstead of the web page level. As per the example gven n Fgure 3, the CS100 course entty can be ndexed as a sngle unt (f the CS100 web unt s successful constructed). However, f three ncomplete web unts are created from the CS100 course entty, we need to ndex three unts although all of them represent CS100. It s not effcent for search engnes. Snce each ncomplete web unt contans ncomplete nformaton about CS100, t mght cause search engnes to fal to retreve them for some user queres n the worst case. Fgure 3. Web unt examples: CS100 and Johnson 3. Problem Statement Gven a collecton of web pages and a set of concepts, the web unt mnng problem s to construct web unts from these web pages and assgn them the approprate concepts. Web unt mnng therefore nvolves two man tasks: Fndng the set of web pages that form each web unt, and classfyng the constructed web unts. Web unt of the concept s a web page or a set of web pages from a web ste that jontly provdes nformaton about a concept nstance. A web unt conssts of exactly one key page and zero or more support pages. Key page s a page whch has lnks to the all the support pages havng the supplementary nformaton about the concept. If a web unt conssts of a key page only, we call t a one page web unt and mult-page web unt otherwse. A lnk connectng any two pages from a mult-page web unt s known as an ntra-unt lnk. Two example web unts are llustrated n Fgure 3: a course web unt and a faculty web unt. The CS100 course web unt (refer Fgure 3.a) conssts of 8 pages; the frst page s the course's key page (underlned) and the others provde supplementary course nformaton.e. support pages. Smlarly, among the 6 pages, the frst page n the Johnson faculty web unt (refer Fgure 3.b) s the key page and the remanng pages provde nformaton about research, publcaton, teachng and so on. Every page n a web unt contrbutes a pece of nformaton. Snce a web unt has rcher and more complete content than the ndvdual web pages, so web unt s a more approprate granularty for classfyng, ndexng and organzng web nformaton. 4. Desgn The framework for the overall mnng procedure to solve the web unt mnng problem can be brefly enumerated as follows: 1) Tranng phase: The nput to ths phase s the set of labelled web unts. Ths phase has some set of concept unts for each concept or category. Each unt conssts of one key page as well as zero or more support pages. All the pages are preprocessed and the classfer s traned. 2) Web unt constructon phase: The nput to ths phase s set of test pages. Ths phase takes all the test pages and generates the web drectory. Web drectory s then processed and web unts consstng of one key page as well as zero or more pages wll be generated. 3) Web unt classfcaton phase: The nput to ths phase s all the constructed web unts. Ths phase classfes the generated web unts usng the classfers from the tranng phase. Support vector machne algorthm s used for classfcaton. In all these phases, the web pages have to be preprocessed as per the requrement of classfcaton algorthm. In the proposed concept unt mnng approach, the classfcaton s not an teratve process and the 3

4 method of constructng web unts s dfferent from the exstng WUM method. The overall desgn of the proposed method s shown dagrammatcally n Fgure 4 and explaned n detal n the next subsectons. used here for stemmng. Document count (d) s calculated for each word, whch s the number of documents n whch the word contans. The nverse document frequency (df) of the words s then calculated as follows. Where N s the number of tranng documents. Lst of words and the correspondng nverse document frequency are created whch wll be ndexed and used n the next phases for feature weght calculatons. Fgure 4. Mnng of Concept unts 5. Soluton Methodology Our soluton approach adopts the followng steps to perform concept unt mnng. A dataset consstng of web pages from the four dfferent unverstes s chosen as nput. The steps n the soluton strategy ncludes generaton of word lst of the web pages, preprocessng of all the web pages to extract features, representaton of theses features n the form feature vectors, constructon of web unts usng the feature vectors, classfcaton of the web unts usng SVM classfer and fnally evaluaton of web unts. These steps are explaned n detal n the followng sectons. 5.1 Generaton of word Lst Ths s the frst phase n the soluton approach. The target documents of our applcaton are web pages. The words from the all the tranng documents need to be dentfed properly, n order to enable proper web page feature extracton. In ths step, all the web pages from tranng web page collecton are parsed to get the content, then content s tokensed and transformed to lower case. Some of the words are non nformatve whch wll not contrbute to dstngush the documents, whch are called stop words (ex: s, was, when, etc). These stop words are removed from ths lst. Stemmng s the process of extractng from a word the meanngful part, known as the lemma, and gnorng nflecton, declenson, or plural suffxes,.e. gettng the root of a word. Stemmng s appled after removng the stop words, whch wll reduce the number of words. Porter stemmng [14] algorthm s 5.2 Preprocessng of web pages In ths step, all web pages are scanned and features are extracted. Each concept unt conssts of one key page and zero or more support pages. These web pages have to be preprocessed and features need to be extracted before tranng or testng. Ttle, text, and hyperlnk text are consdered as features n ths paper. Preprocessng of the web page s depcted n Fgure 5. As mentoned n the prevous secton, the web pages are parsed frst to get the ttle, text and hyperlnk text; ths text s tokensed and transformed to the lowercase; stop words are removed; stemmng s appled to get the root words; and these words are ndexed n the wordlst created n the prevous secton and term frequency s calculated. Term frequency s the number of occurrences of that term n the web page. The calculated term frequences are used for calculatng the feature weghts. Preprocessng s used n both tranng as well as testng. Fgure 5. Preprocessng of web page 5.3 Generaton of feature vectors Feature vector s a vector contanng feature ds and correspondng weghts of a web page. These vectors are generated n both tranng as well as testng. In case of tranng, we have a set of labeled web unts where each web unt conssts of one key page and zero or more support pages. The classfer has to be bult for each concept label. The postve tranng examples for a concept C j consst of key pages of the web unts labeled wth concept C j ; the negatve tranng examples nclude the support pages of web unts n C j and both key pages and support pages of the web unts that do not belong to C j. We have now the term frequences (tf) of each term of 4

5 a page and df values. The weght of a term s calculated as follows w = tf * df The constructed web unts are classfed only based on the key pages, so for each key page feature vector s constructed and gven to the classfer n the case of testng. 5.4 Hypertext Categorzaton usng SVM SVM (Support Vector Machne) has been proved to be very effectve n dealng wth hgh-dmensonal feature spaces - the most challengng problem of other machne learnng technques due to the so-called curse of dmensonalty. The basc dea of SVM s to fnd an optmal hyperplane to separate two classes wth the largest margn from pre-classfed data. To construct an optmal hyperplane, SVM uses an teratve tranng algorthm, whch s used to mnmze the error functon. Accordng to the form of the error functon, SVM models can be dvded nto four dstnct groups such as C-SVM classfcaton, nu-svm classfcaton, epslon-svm regresson, and nu-svm regresson [15]. C-SVM s the mostly used SVM method for classfcaton. C-SVM classfcaton s used n ths work also. In rest of the paper SVM means C-SVM only. In SVM, there are four common kernels such as Lnear, Polynomal, Radal Bass Functon (RBF), and Sgmod [15,16]. Support vector machnes use quadratc programmng for fndng the hyperplane. In ths work, Lnear SVM s used, so we consdered only lnear separable case. A more mathematcally rgorous treatment of the geometrc arguments of SVM can be found n [17,18]. Understandng hgher dmensonal s dffcult, so consder the followng example n two-dmensonal spaces [19]. Hypertext s a type of text. SVM has been known to be very effcent n Text Categorzaton (TC) due to a number of followng reasons: Hgh dmensonal nput spaces: Normally, n TC the dmensons of nput spaces are very large, and t s very challengng to other machne learnng technques. However, SVM does not depend on the number of features, and thus t has the potental to handle large feature spaces. Few rrelevant features: In TC, there are very few rrelevant features. Therefore, the uses of feature selecton n other machne learnng approaches to reduce the number of rrelevant features wll also decrease the accuracy of the classfers. In contrast, SVM can handle very large feature space and thus feature selecton s only optonal. Document vectors are sparse: In TC, each document vector has only few entres whch are not zero (.e., sparse). Moreover, there are many theoretcal and emprcal evdence that SVM s well suted for problems wth dense concepts and sparse nstances lke TC. Most TC problems are lnearly separable: In practce, many TC problems are known to be lnearly separable. Therefore, SVM s sutable for these tasks. Ths paper concerns about the hypertext categorzaton whch s a type of text categorzaton, so SVM s best sutable for ths. 5.5 Construct web unts Web unts are generated n ths phase. Ths phase conssts of two steps: 1. Constructon of web drectory and 2. Web unt constructon. Frst, we wll construct the web drectory usng the URLs of the pages and ths wll be gven as nput to the web unt constructon algorthm. Gven a collecton of web pages from a web ste, together wth web folders extracted from them, a web drectory s a tree structure wth web folders as nternal nodes and web pages as leaf nodes [3]. A web folder s usually created to contan a set of closely related web pages. We dentfy sx connecton patterns of a web folder. Fully connected: There exst hyperlnks between any two web pages. Star: There exsts one web page that has hyperlnks pontng to all other web pages. Lnear: There exsts a lnear hyperlnk path to connect all web pages. Herarchcal: There exsts a herarchcal hyperlnk structure to connect all web pages. Isolated: There does not exst any hyperlnk between any two pages. Partally connected: There exst some hyperlnks to connect a few web pages, but cannot fnd a way to connect all web pages. A web folder may satsfy more than one connecton pattern. To make t smple, when analyzng a web folder, we examne connecton patterns n the order of fully connected, star, lnear, herarchcal, solated, and partally connected. If a web folder contans only one web page or satsfes any of the four connecton patterns, namely fully connected, star, lnear, or herarchcal, we consder t as well-connected. In a well-connected web folder there exsts one entry page, these entry pages are very lkely to be the key pages of web unts. Here we wll 5

6 consder web unt and web fragment as same. The web fragment constructon algorthm s shown n Algorthm 1. We create a web drectory and run WebFragGen (root), where root s the root web folder of the web drectory. The web drectory s traversed n a bottom-up manner. A web folder wll be examned only after all ts chld web folders have been examned or t has no chld web folder. If a web folder f has no chld web folder and s well-connected, a canddate web fragment frag s created wth all web pages n f. frag s then checked by a functon named Is_ Fragment, whch determnes whether frag s a web fragment or not. Once Is_ Fragment returns true value, frag s added to the web fragment lst wfl and f s removed from the web drectory. If the currently-vsted web folder f has some chld web folders sub(f), t ndcates that web fragments are not found n sub(f). We frst create a canddate web fragment frag wth all pages n subt (f) and test t. If t fals, we construct another canddate web fragment frag wth all pages n f and test t agan. When constructng a canddate web fragment, we also dentfy one canddate key page based on the connecton pattern of the correspondng web folder and some heurstcs. the web unt and the support pages are not mportant at all. Ths also suggests that the web unt mnng performance s only determned by ts ablty to dentfy and classfy key pages correctly. If α = 1/ u, the key page and support pages of a web unt enjoy equal mportance. Hence, the web unt mnng performance must consder both key and support pages. 5.6 Classfy the web unts Ths s the last step n concept unt mnng. The constructed web unts are classfed based manly on the key page. The feature vector s generated from the key page for each constructed web unt. Ths vector s gven to the SVM classfer, whch wll classfy based on the prevously constructed models. A web unt can be descrbed by two separate sets of features: content features and web ste structure features. The content features refer to the words n the key page, the ttle and the anchor words. Web ste structure features refer those obtaned by studyng how the web unts are organzed n a web ste. Both these features are used n ths classfcaton. 5.7 Web unt evaluaton There are two dffcultes n evaluatng web unt mnng methods. Frstly, web unts are subgraphs and they are dscovered n the process of web unt mnng. Thus t s dffcult and unfar to expect perfect matchng between the labeled web unts and the mned web unts. Secondly, the notons of key and support pages also complcate the performance measurement. Hence, the standard precson and recall measures n text classfcaton cannot be appled drectly. Therefore the author Sun [3] proposed new precson and recall defntons for web unt mnng. To account for the mportance of key pages, a satsfacton varable α s ntroduced to represent the degree of mportance when the key page of a web unt s correctly dentfed. Gven a web unt u, the value of α s n the range [1/ u, 1] where u s the number of web pages n web unt u. If α = 1, the key page completely domnates Let the key page of a web unt u be denoted by u.k and the support pages be denoted by the set u.s. Gven a web unt u constructed by a web unt mnng method, we must frst match t wth an approprate labeled web unt u', also known as the perfect web unt. We defne u' to be the labeled web unt contanng u.k and u' has the same label as u ; u.k can be ether the key page or a support page of u'. The contngency table for matchng a web unt u wth ts perfect web unt u' s shown n Table 1. Each table 6

7 entry represents a set of overlappng web pages between the key/support pages of u and u'. For example. TK = { u. { u. and TS = u. s u. s. The entres n the last column and row carry specal meanngs as follows. FS = u. s ( u. s { u. ). NK = { u. { u. u. s. NS = u. s { u. u. s. Note that TK + KS + NK = 1 and TK + SK = 1. If the perfect web unt for u does not exst, u s consdered nvald and wll be assgned zero precson and recall values. Otherwse, the precson and recall of a web unt, u, are defned as follows. Table 1: Contngency table for web unt u 6. Expermental Study All the experments are performed on a Pentum-IV processor, 2.53 GHz CPU and 512 MB RAM. The operatng system envronment s Fedora Core 3. We used java for mplementng the proposed approach. Real World Wde Knowledge Base (WebKb) [21] dataset s used for testng the performance of our approach. Ths dataset conssts of web pages from four dfferent unverstes Cornell, Texas, Washngton and Wsconsn. All the web pages are from computer scence department of the respectve unverstes. As there are no exstng labeled web unt datasets for our experments, we used UntSet dataset prepared for teratve web unt mnng [3] from WebKB dataset. WebKB data set conssts of 4159 web pages collected from four unverstes were manually classfed nto 7 categores: student, faculty, staff, department, course, project and other. The other s a specal category for pages that not assgned as the man pages n the last sx categores. The UntSet data set conssts of web unts grouped and labeled manually. The pages from frst categores were used as key pages of web unts whle the majorty of pages from other category were used as support pages of the correspondng web unts. Only four concepts student, faculty, course and project were expermented as the number of web unts of other concepts are small ( 20) smlar to the WUM. The web unt statstcs are shown n Table 2 where u and p refer to the number of web unts and pages respectvely.. α. TK + (1 α ). TS Pru = α + (1 α ).( KS + TS + FS ) Table 2: UntSet web unt dstrbuton α. TK + (1 α ). TS Re u = α + (1 α ).( SK + TS + NS ) Suppose M web unts are constructed and assgned wth concept C j, and N web unts are manually labeled wth C j, the precson and recall of the concept, C j, denoted by Prc j and Rec j, are defned as follows. Pr c j Re c j = = u C j M u C j N Pr u Re From the above defnton, the macro/mcro average precson and recall for a set of concepts can be easly derved [20]. u We used three unverstes for tranng and one unversty for testng. UntSet dataset s used for tranng the web unt classfer. Results of WUM method are used for comparng the CUM method. The precson (Pr), recall (Re), and F1 value for each category of these methods are gven. Macro and Mcro averages are also presented. In Table 3 and Table 4 results of concept unt mnng method for α=1, α=0.5 are presented. As α = 1/ u ndcates the key page and support pages of a web unt have the equal mportance, we presented the results of both WUM and CUM methods for α = 1/ u n Table 5. Web unts are extracted wth reasonable accuraces usng WUM although the performance of dfferent 7

8 categores vares. The low precson of WUM s manly due to the exstence of ncomplete web unts. In summary, web ste structure and key page content are the two major factors that affect the performance of WUM. The WUM results could be regarded as a baselne results to evaluate the performance of the proposed method. In Concept unt mnng, web unts are constructed usng the hyperlnks. In ths approach, the ncomplete web unt problem s handled by reducng the possble classfcaton errors. Its nfluence on the web unt mnng performances s mproved for some categores. The mproved precson scores are manly because the number of ncomplete web unts have been greatly reduced through a more effectve web unt constructon step. The reduced recall scores are manly because CUM faled to dentfy some low qualty web unts. Table 3: Web unt mnng results (α = 1) Macro/Mcro average values of both the methods are presented n Fgure 7. Values MaPr MaRe MaF1 MPr MRe MF1 Macro/Mcro measures Fgure 7: Macro/Mcro-averaged results of the two methods WUM CUM 7. Concluson and Future work Table 4: Web unt mnng results (α = 0.5) Table 5: Web unt mnng results (α =1/ u ) From the Table 5, t s clear that the performance of Concept unt mnng method s good for some concepts but the overall Macro/Mcro average values are showng mprovement over WUM method. The comparson of Present days major source of nformaton s the web. The amount of data avalable onlne s ncreasng. Web unt mnng ams to dscover the set of web pages that represent a sngle concept entty from a web ste. Mned web unts are usually objects of nterest for people who search n that web ste, e.g. courses, professors, or students enttes from a unversty web ste. As a result, a major applcaton of web unts s to ncorporate them nto search engnes so as to support better ndexng and searchng. An exstng web unt-mnng algorthm, WUM, creates ncomplete web unts, wth each coverng only a subset of web pages of a sngle concept entty. The exstence of ncomplete web unts does harmful to usng web unts to ndex web nformaton. In order to address ths problem, Concept unt mnng method s proposed. Experments wth the UnKB dataset show that a large porton of ncomplete web unts removed and web unt mnng performance s thus mproved. CUM s not an teratve process thus reduces the tme requred to mne the concept unts. Web unt mnng s a new research feld. There s stll much room for further mprovement. For example, as exstng web unt mnng algorthms heavly rely on web ste structure to construct web unts and key page content to classfy web unts, we need to conduct experments wth other web stes. More research efforts are requred to mprove web unt mnng performance on those web stes not well-structured and on those web unts wth key pages of lttle content. In another drecton of our future work, focus on utlzng mned web unts to enhance web nformaton retreval and explorng ways for modellng web unts and develop web unt-based rankng strateges. 8

9 8. References 1. Da Costa, M.G., Jr.; Zhguo Gong, Web structure mnng: an ntroducton, IEEE Internatonal Conference on Informaton Acquston, pp. 6, July Jadeep srvastava, prasanna Deskan, vpn kumar, Web mnng accomplshment and future drectons, In Natonal scence foundaton workshop 2001, pp Sun A. and E.-P. Lm, Web unt mnng: fndng and classfyng sub graphs of web pages, n Proceedngs of the twelfth nternatonal conference on Informaton and knowledge management, S. Chakrabart, B. Dom, and P. Indyk, Enhanced hypertext categorzaton usng hyperlnks, n Proceedngs of the ACM SIGMOD nternatonal conference on Management of Data, 1998, pp S. T. Dumas and H. Chen, Herarchcal classfcaton of Web content, In Proc. of ACM SIGIR, pages , Athens, Greece, M. Craven and S. Slattery. Relatonal learnng wth statstcal predcate nventon: Better models for hypertext, Journal of Machne Learnng, vol. 43, no. 1-2, pp , A. Z. Broder, R. Krauthgamer, and M. Mtzenmacher, Improved classfcaton va connectvty nformaton, In Proc. of 11th ACM-SIAM Sym. on Dscrete Algo., pages , L. Getoor, E. Segal, B. Taskar, and D. Koller. Probablstc models of text and lnk structure for hypertext classfcaton, In Proc. of Intl Jont Conf. on Artfcal Intellgence Workshop on Text Learnng: beyond Supervson, Seattle, WA, J. Furnkranz. Hyperlnk ensembles: A case study n hypertext classfcaton, Journal of Informaton Fuson, vol. 1, pp , H.J. Oh, S. H. Myaeng, and M.H. Lee. A practcal hypertext categorzaton method usng lnks and ncrementally avalable class nformaton, n Proceedngs of the 23rd annual nternatonal ACM SIGIR conference on Research and development n nformaton retreval, 2000, pp Y. Yang and X. Lu. A re-examnaton of text categorzaton methods, n Proceedngs of the 22nd Annual Internatonal ACM SIGIR Conference on Research and Development n Informaton Retreval, 1999, pp L. Terveen, W. Hll, and B. Amento. Constructng, organzng, and vsualzng collectons of topcally related web resources, ACM Transactons on Computer-Human Interacton, vol. 6, no. 1, pp , Y. Tan, T. Huang, W. Gao, J. Cheng, and P. Kang. Two-phase web ste classfcaton based on hdden markov tree models, n proceedngs of IEEE/WIC Web Intellgence, October 13-17, M.F Porter, An algorthm for suffx strppng, program, 14(3): , C.J.C. Burges, A tutoral on support vector machnes for pattern recognton. Data Mnng and Knowledge Dscovery, 2(2): , Smola, A. and Schölkopf, B. A tutoral on support vector regresson, Techncal Report NC2-TR NC2-TR , NeuroCOLT 2, Bennett K. and Bredenstener E., Dualty and Geometry n SVMs, In P. Langley edtor, Proc. Of 17 th Internatonal Conference on Machne Learnng, Morgan Kaufmann, San Francsco, 65-72, Crsp D. and Burges C., A geometrc nterpretaton of v-svm classfers, Advances n Neural Informaton Processng Systems, 12 ed. S.A. Solla, T.K Leen and K.R. Muller, MIT Press, Shuonan Dong, Support Vector Machnes Appled to Handwrtten Numerals Recognto., machne learnng, Sun A and E.-P. Lm. Herarchcal text classfcaton and evaluaton., In Proc. of the 1st IEEE Int. Conf. on Data Mnng, pages , Calforna, USA, Nov WebKb data from ject/theo-20/www/data/, feb