Enhancement of Infrequent Purchased Product Recommendation Using Data Mining Techniques

Size: px
Start display at page:

Download "Enhancement of Infrequent Purchased Product Recommendation Using Data Mining Techniques"

Transcription

1 Enhancement of Infrequent Purchased Product Recommendaton Usng Data Mnng Technques Noraswalza Abdullah, Yue Xu, Shlomo Geva, and Mark Loo Dscplne of Computer Scence Faculty of Scence and Technology Queensland Unversty of Technology, 2 George Street Brsbane QLD 4000 noraswalza.abdullah@student.qut.edu.au, {yue.xu,shlomo.geva,m.loo}@qut.edu.au Abstract. Recommender Systems (RS) have emerged to help users make good decsons about whch products to choose from the vast range of products avalable on the Internet. Many of the exstng recommender systems are developed for smple and frequently purchased products usng a collaboratve flterng (CF) approach. Ths approach s not applcable for recommendng nfrequently purchased products, as no user ratngs data or prevous user purchase hstory s avalable. Ths paper proposes a new recommender system approach that uses knowledge extracted from user onlne revews for recommendng nfrequently purchased products. Opnon mnng and rough set assocaton rule mnng are appled to extract knowledge from user onlne revews. The extracted knowledge s then used to expand a user s query to retreve the products that most lkely match the user s preferences. The result of the experment shows that the proposed approach, the Query Expanson Matchng-based Search (QEMS), mproves the performance of the exstng Standard Matchng-based Search (SMS) by recommendng more products that satsfy the user s needs. Keywords: Recommender system, opnon mnng, assocaton rule mnng, user revew. 1 Introducton The large amount of nformaton that s avalable on the Internet leads to an nformaton overload problem [1]. Recommender systems (RS) have emerged to help users deal wth ths problem by provdng product suggestons accordng to ther needs and requrements. Nowadays, recommender systems have been wdely appled by major e-commerce webstes for recommendng varous products and servng mllons of consumers [2]. However, many of the recommender systems are developed for recommendng nexpensve and frequently purchased products lke books, moves and musc. Many of the systems that are currently avalable for searchng nfrequently purchased products lke cars or houses only provde a standard matchng-based search functon, whereby the system retreves products that match exactly wth the user s query. Ths query s normy short and does not reflect the user requrements fully. In M. Bramer (Ed.): IFIP AI 2010, IFIP AICT 331, pp , IFIP Internatonal Federaton for Informaton Processng 2010

2 58 N. Abdullah et al. addton, many users do not have much knowledge about the products, thus, they cannot provde detaled requrements of the product attrbutes or features. Therefore, a recommender system that can predct users preferences from the ntal nput gven by the users s needed for recommendng nfrequently purchased products. Many of the current recommendaton systems are developed usng a collaboratve flterng (CF) approach [2][3][4]. The collaboratve flterng approach utlzes a large amount of ratngs data or users prevous purchase data to make meanngful recommendatons. Ths approach s not sutable for recommendng nfrequently purchased products because there s no prevous users purchase hstory or explct ratngs data about the avalable products, as the products are not often purchased by the users durng ther lfetme, and users are not able to provde ratngs for products they never use. Fortunately, wth the popularty of e-commerce applcatons for sellng products on the web, users are gven more opportunty to express ther opnon on products they prevously owned va the onlne merchant webstes and, as a result, more and more users share revews concernng ther experence wth the products. These revews provde valuable nformaton that can be used by recommender systems for recommendng nfrequently purchased products. Ths paper proposes a recommender system approach that utlzes knowledge extracted from user revews for recommendng nfrequently purchased products. Opnon mnng and rough set assocaton rule mnng are appled to extract knowledge from the user revew data to predct a user s preferences. The knowledge about user s preferences s used to expand a user s query to mprove the recommendaton result. The followng sectons of ths paper are organzed as follows. Frst, the related work wll be brefly revewed n secton 2. Then, the proposed approach wll be dscussed n secton 3. The expermental results and evaluaton wll be dscussed n secton 4. Fny, the concluson wll be gven n secton 5. 2 Related Work Recently, automatc revew mnng and summarzaton of extractng product features values from user revews s becomng a popular research topc [5][6][7]. Revew mnng and summarzaton, also ced opnon mnng, ams at extractng product features on whch the revewers express ther opnon and determnng whether the opnons are postve or negatve [7]. [5] proposed a model of feature-based opnon mnng and summarzaton, whch uses a lexcon-based method to determne whether the opnon expressed on a product feature s postve or negatve. The opnon lexcon or the set of opnon words used n ths method s obtaned through a bootstrappng process usng the WordNet. Then, [6] proposed a technque that performs better than the prevous methods by usng the holstc lexcon-based approach. Ths technque deals wth context dependent opnon words and aggregatng multple opnon words n the same sentence, whch are the two man problems of the exstng technques. Despte the growth n the number of onlne revews and the valuable nformaton that they can provde, not much work has been done on utlzng onlne user revews for creatng recommendatons [4]. [8] employed text mnng technques to extract useful nformaton from revew comments and then mapped the revew comments nto the ontology s nformaton structure, whch s used by the recommender system

3 Enhancement of Infrequent Purchased Product Recommendaton 59 to make recommendatons. In ther approach, users must nput the features of the product that are most mportant to them and the recommendatons are generated based on the features provded by the users. In contrast, our approach ams to predct users preferences about the product features from the ntal nput gven by them, and use the knowledge to recommend products to the users. The followng secton wll dscuss the proposed approach n detal. 3 Proposed Approach User revews contan wrtten comments expressed by prevous users about a partcular product. Each comment contans a user s opnon or how the user feels about the product s features (e.g. good or bad). Opnon mnng technques are appled on user revews to determne each user s sentmental orentaton towards each feature, whch ndcates whether the user lkes or dslkes the product n terms of ths feature. The over orentaton of each revew s also determned to summarze whether a user s opnon about the product s postve, negatve or neutral. The user s opnons generated from the revews reflect ther vewpont concernng the qualty of the products. A revew wth a postve orentaton ndcates that the revewer (.e. the user) was satsfed wth the product n some aspects. Ths means that at least some attrbutes of ths product were attractve to the user. If we can dentfy these attractve attrbutes for each product, based on these attrbutes we can determne the products that wll be of most nterest to the user. Based on ths dea, we propose to apply assocaton rule mnng technques to generate patterns and assocaton rules from users postve revews. By usng the extracted patterns and assocaton rules for a target user, we can predct the user s preferred product attrbutes and, thus, recommend products that best match the user s preferences. The proposed recommender system approach contans three man processes: ) Opnon mnng to extract a user s sentmental orentatons to the product features from the user onlne revews, summarzng and presentng the revews n a structured format, ) Rough set assocaton rule mnng to generate assocaton rules between the product attrbute values, and ) Query expanson to expand a user s query by usng assocaton rules between product attrbute values. The followng sectons wll provde the defntons of the concepts and enttes nvolved and the specfc problems of ths research. In addton, they wll also explan each process n detal. 3.1 Defntons Ths secton frst defnes the mportant concepts and enttes used n ths paper and then hghlghts the specfc problems that we am to solve. Product Products nclude any type of product or onlne servce for whch users can search for nformaton or purchase. Ths paper focuses partcularly on nfrequently purchased products such as cars or houses. A product p can be represented by two-tuple ( C, F), C = c, c,..., c } s a set of attrbutes representng the techncal characterstcs of the { 1 2 n

4 60 N. Abdullah et al. product defned by doman experts and F = { f1, f2,... fm} s a set of usage features representng the usage performance of the product defned by doman experts or the users of the product. The usage features are usuy the aspects commented upon by the users of the product. In ths paper, we assume that both the product attrbutes and usage features have been specfed. For example, for the onlne car search doman on whch we conducted our experments, the followng car characterstcs and usage aspects were chosen as the car attrbutes and usage features: C= {Make, Model, Seres, Year, Engne Sze, Fuel System, Fuel Consumpton, Tank Capacty, Power, Torque, Body Type, Seatng Capacty, Standard Transmsson, Drve, Turnng Crcle, Kerb Weght, Dmenson, Wheelbase} F= {Comfort Practcalty, Prce Equpment, Under Bonnet, How Drves, Safety Securty, Qualty Relablty, Servcng Runnng Costs, Aesthetcs Stylng} User Revews For a product, there s a set of wrtten revews about the product gven by users. Each revew conssts of a set of sentences comprsed of a sequence of words. In many e- commerce webstes, the product features to be revewed have been specfed so that users can provde ther comments and opnons on each partcular feature. For revews that are not classfed accordng to any specfc feature, opnon mnng technques can be used to dentfy the product features that are addressed by each sentence n a revew [5]. In ths paper, we assume that the sentences n each revew have been dvded nto groups, each of whch conssts of the sentences that talk about one feature of the product. Let R = { R1, R2,..., Rm} be a revew gven by a user to a product, R s a set of sentences that are comments concernng feature f. By applyng opnon mnng technques, whch wll be dscussed n the next secton, we can generate the user s sentmental orentaton concernng each feature, denoted as O = { o1, o2,..., om} and an over orentaton of the revew O, where o, O { postve, negatve, neutral}. Structured revew A structured revew s a 4-tuple consstng of the sentmental orentatons to a product generated from a revew and the product s attrbutes and features, denoted as sr = ( C, F, O, O ), where C and F are the attrbutes and features of the product, O and O are the sentmental orentatons to the features and the over orentaton of the revew, respectvely. Let SR = sr, sr,..., sr } be a set of structured revews. { 1 2 SR Informaton System Informaton system, I contans 2-tuple of nformaton, denoted as I = ( U, A), where U s a set of objects, and A s a set of attrbutes for each object. In ths paper, U s a set of structured revews and A conssts of the product attrbutes, features, the sentmental orentatons to the features and the over orentaton of the revew,.e. A = c,..., c, f,..., f, o,..., o, O }. { 1 n 1 m 1 m

5 Enhancement of Infrequent Purchased Product Recommendaton 61 The problems that we am to solve are as follows: ) Gven a user revew R on a product p, the revew has to be summarzed and represented n a structured revew sr. Then from a set of structured revews SR, an nformaton system I has to be generated usng only revews sr that have a postve or neutral over orentaton O { postve, neutral }. ) From the nformaton model I, a set of assocaton rules between product attrbute values c has to be extracted usng rough set assocaton rule mnng to represent users preferences. ) To develop a query expanson technque by utlzng assocaton rules extracted from nformaton model I, to retreve products that best meet the users preferences. 3.2 Opnon Mnng We adopted the approach proposed by [5] to perform the opnon mnng process. The frst task n ths process s to dentfy the sentmental orentatons concernng the features. A user expresses a postve, negatve or neutral opnon o, on each feature f, n a revew R usng a set of opnon words W = { w1, w2,..., wn}. To fnd out opnon words used by the user (e.g. good, amazng, poor etc.) that express hs/her opnon on a product feature f, adjectves used by the user n a revew R are extracted. The orentaton of each opnon word ow { negatve, postve} s then dentfed by utlzng the adjectves synonym set and antonym set n WordNet [9]. In WordNet, adjectves share the same orentaton as ther synonym and opposte orentatons as ther antonyms. To predct the orentaton ow of a target adjectve word w, a set of common adjectves wth known orentaton S = { s1, s2,..., sn} ced as seed adjectves, and WordNet are searched to fnd the word s synonym or antonym wth the known orentaton. If the word s synonym s found, the word s orentaton s set to the same orentaton as ts synonym and the seed lst s updated. Otherwse, f the word s antonym s found, the word s orentaton s set to the opposte of the antonym and s added to the seed lst. The process s repeated for the target words wth unknown orentaton and the words orentatons are dentfed usng the updated seed lst. Fny, the sentmental orentaton o of each feature f s dentfed by fndng the domnant orentaton of the opnon words n the sentence through countng the number of postve opnon words ow {postve} and the negatve opnon words ow {negatve}, for a revew R. If the number of postve opnon words s more than the negatve opnon words, the orentaton o of the feature f s postve o {postve}, otherwse negatve o {negatve}. If the number of postve opnon words equals the negatve opnon words, the orentaton o of the feature f s neutral o {neutral}. Fny, opnon summarzaton s performed to determne the over orentaton of each revew R and represent the revew n a structured revew sr = C, F, O, O ). (

6 62 N. Abdullah et al. O s determned by calculatng the number of postve features o {postve}, neutral features o {neutral}, and negatve features o {negatve} for the revew. If the number of postve features and neutral features s more than negatve features, the over orentaton O for the revew s postve O {postve}, otherwse negatve O {negatve}. If the number of postve features and neutral features s equal to the negatve features, the over orentaton O for the revew s neutral O {neutral}. 3.3 Rough Set Assocaton Rule Mnng Standard onlne product search engnes perform a match process to fnd products that satsfy a user s query, whch usuy conssts of the product attrbutes or characterstcs that the users are lookng for. However, many users do not have suffcent knowledge about the product and may not know the exact product attrbutes. Therefore, the attrbutes n the query may not be the rght attrbutes to query. Onlne user revews are provded by users who have used the product and the opnons about the product reflects the users vewponts concernng the product based on ther experence of usng the product. The products that are postvely revewed must possess attractve attrbutes or characterstcs that pleased ther users. Based on ths ntuton, we propose to fnd the assocatons between the product attrbutes from the users revews that have a postve orentaton. These assocatons can be used to predct users preferences to product attrbutes. In ths paper, we utlze the rough set assocaton rule mnng approach [10] to fnd hdden patterns n data and generate sets of assocaton rules from the data. We chose the rough set assocaton rule mnng technque because t ows us to easly select the condton and decson attrbutes of the rule. Rough set data analyss starts from a data set that s also ced a decson table or an nformaton system. In the table, each row represents an object, each column represents an attrbute, and entres of the table are attrbute values. An attrbute can be a varable or an observaton or a property, etc. As we have defned above, an nformaton system s wrtten as I = ( U, A), n ths paper, U s a set of structured revews and A conssts of the product attrbutes, features, and the sentmental orentatons,.e. A = { c1,..., cn, f1,..., fm, o1,..., om, O}. In ths paper, the nformaton system I = ( U, A) s created from the structured revews wth postve/neutral orentaton. Let sr SR be a structured revew, sr (a) be the value of attrbute a A, U = { sr sr SR, sr( O ) { postve, neutral}} s the set of objects n the table. The nformaton system contans attrbute values for a set of products that have receved good comments from the revewers. The next step n rough set assocaton rule mnng s to partton the nformaton system nto two dsjonted classes of attrbutes, ced condton C and decson D attrbutes. The nformaton system s then ced a decson table S = ( U, C, D), where C and D are dsjonted sets of condtons and decson attrbutes, respectvely. The condton and decson attrbutes are selected from product attrbutes C and features F n A n the nformaton system I. The attrbutes chosen as the condton are the product attrbutes or features that are usuy provded by a user as the ntal nput n a query and the decson contans other attrbutes and features of the products. For

7 Enhancement of Infrequent Purchased Product Recommendaton 63 example, for the onlne car search on whch we conducted our experments, the car make, model, prce, etc are chosen as the condton. Then, assocaton rules are generated from the decson table through determnng the decson attrbutes values based on the condton attrbute values. The assocaton rules between the product attrbutes values show the relatonshp between the ntal product attrbute values gven by a user wth other product attrbutes n whch the user may be nterested. Thus, these assocaton rules can be used to represent the user s preferences to retreve products that wll most lkely ft the user s requrements. 3.4 Query Expanson The query expanson process ams to mprove the ntal user s query n order to retreve more products that mght ft the user s requrements. A user s query Q s represented by a set of terms Q = { q1, q2,..., qn} that the user provdes to the search engne. In the product search, the terms n the query are attrbute values of the product that the user s lookng for. The query, genery, s very short and lacks suffcent terms to present the user s actual preferences or needs. Query expanson nvolves addng new attrbute values E = { e1, e2,..., en} to the exstng search terms Q = { q1, q2,..., qn} to generate an expanded query EQ = { eq eq ( E Q)}. The attrbute values eq EQ are used to retreve products to recommend to the user. All products that have attrbute values that match wth any attrbute values of the expanded query eq are selected as the canddate products CP = { cp1, cp2,..., cpn}. The smlarty between each product cp CP and the expanded query EQ s calculated by matchng each attrbute value of the product query. The smlarty value v for the product calculated as the total number of attrbute values of the product that match wth the attrbute values n the expanded query. Then, the products are ranked based on the smlarty value. The top-n products are recommended to the user based on ther rankng. The proposed system may retreve products that exactly match the user s nput, as well as other products n whch the user may be nterested by predctng the user s preferences from hs/her ntal nput. cp wth the value of the same product attrbute eq n the expanded cp wth the expanded query EQ s 4 Experment and Evaluaton 4.1 Experment Method A case study was conducted for the cars doman. Data was collected from one of the car sellng webstes that contans revews provded by users for cars prevously owned by them. The dataset contans 5,504 revews and 3,119 cars. Onlne revews on cars from prevous users were used to extract rules between attrbute values. The opnon mnng technque was frst appled to generate structured revews from the onlne revews. Then ROSETTA [11], a rough set mnng tool was used for extractng rules from the nformaton system generated from the structured revew. Four processes were nvolved n extractng rules ) Data pre-processng and attrbute selecton, whch

8 64 N. Abdullah et al. ncluded preparng a dataset and selectng mportant attrbutes to be ncluded n the decson tables, ) Data categorzaton, whch nvolved transformng the attrbute values nto categorcal values to reduce the dmensonalty of the data and to reduce the number of rules generated, ) Selecton of decson and condton attrbutes and v) Rule nducton, whch generated rules representng assocatons between query terms (e.g. car make and model) and other product attrbutes (e.g. seres year, prce new, engne sze, fuel system etc.) from the decson table. The example of the rule s shown below: CarMake(Toyota), CarModel(Camry) -> Year(>2000_and<=2005), Prce(>30000_and<=50000), EngneSze(>1.6L_and<=3.0L), Seat(4_5), BodyType(SEDAN), Drve(FWD), FuelSystem(FUEL_INJECTED), FuelConsumpton(>9.0L_and<=11.5L), TankCapacty(>51L_and<=70L), StandardTransmsson(4A), Power(>82Kw_and<=146Kw), Torque(>150Nm_and<=284Nm), TurnngCrcle(>11.20m), Wheelbase(>2710mm), KerbWeght(>1126Kg_and<=1520Kg), Dmenson(>4794) Two search technques were developed - the Standard Matchng-based Search (SMS) and the Query Expanson Matchng-based Search (QEMS). The SMS technque retreves cars that match wth a user s query terms exactly. In addton, the QEMS technque retreves cars based on the expanded query of the user s preferences predcted from the rules generated from rough set assocaton rule mnng process. For evaluatng the proposed approach, prevous users navgaton hstory from the exstng system log data was used as a testng data. A sequence of cars vewed by each user was generated from the log data. The frst car n each user s sequence was chosen as the nput and some of the attrbutes of the car, such as car make and car model, were consdered as the query for that user. The other cars n the sequence were consdered as the cars that the user s nterested n and they were used as the testng cars to test whether the two search engnes recommend these cars to the user. For each query (.e. the frst car of a user), cars recommended by both systems for a dfferent number of the top retreved results (N=10, 20, 30, 40 and 50) were compared wth the testng cars for that user. The rec and precson values for each user were calculated for both technques by usng the followng formula: NM rec = NT precson = NM NR Where NM s the number of cars retreved that match wth the testng cars, NT s the number of testng cars, and NR s the number of retreved cars. Fny, the average rec and precson values for users were calculated for both technques. 4.2 Results and The graphs n Fgure 1 and Fgure 2 show the evaluaton results of the proposed approach. The evaluaton results show that the Query Expanson Matchng-based Search (QEMS) outperformed the Standard Matchng-based Search (SMS), n that ths approach can retreve more car models that the users are nterested n wthout requrng much effort from them. The expanded query can mprove the retreval performance of the Standard Matchng-based Search as t provdes more keywords to represent a user s requrements or preferences.

9 Enhancement of Infrequent Purchased Product Recommendaton 65 Fg. 1. Precson for dfferent number of top retreved results of the SMS and QEMS Fg. 2. Rec for dfferent number of top retreved results of the SMS and QEMS 5 Concluson We have proposed a recommender system approach for recommendng nfrequently purchased products by utlzng user revews data. The evaluaton result shows that our recommendaton approach leads to recommendatons novelty or serendpty, where more unexpected or dfferent tems that meet the users nterests wll be recommended to the users. Ths approach s able to predct a user s preferences and may suggest more products that ft the user s requrements and, also, may help onlne vendors promote ther products. In future work, we ntend to utlze sentmental orentatons of the features for mprovng the product recommendatons. Acknowledgments. Ths paper was party supported by the Smart Servces CRC (Cooperatve Research Centres, Australa). References 1. Schafer, J.B., Konstan, J., Redl, J.: E-commerce Recommendaton Applcatons. Data Mnng and Knowledge Dscovery 5(1-2), (2001) 2. Leavtt, N.: Recommendaton Technology: Wll It Boost E-Commerce? Computer Socety 39(5), (2006)

10 66 N. Abdullah et al. 3. Sarwar, B., Karyps, G., Konstan, J., Redl, J.: Analyss of Recommendaton Algorthms for E-commerce. In: 2nd ACM Conference on Electronc Commerce, pp ACM, New York (2000) 4. Acar, S., Zhang, D., Smoff, S., Debenham, J.: Recommender System Based on Consumer Product Revews. In: 2006 IEEE/WIC/ACM Internatonal Conference on Web Intellgence, pp IEEE Computer Socety, Washngton (2006) 5. Hu, M., Lu, B.: Mnng and Summarzng User Revews. In: Tenth ACM SIGKDD Internatonal Conference on Knowledge Dscovery and Data Mnng, pp ACM, New York (2004) 6. Dng, X., Lu, B., Yu, P.S.: A Holstc Lexcon-based Approach to Opnon Mnng. In: Internatonal Conference on Web Search and Web Data Mnng, pp ACM, New York (2008) 7. Zhuang, L., Jng, F., Zhu, X.Y.: Move Revew Mnng and Summarzaton. In: 15th ACM Internatonal Conference on Informaton and Knowledge Management, pp ACM, New York (2006) 8. Acar, S., Zhang, D., Smoff, S., Debenham, J.: Informed Recommender: Basng Recommendatons on Consumer Product Revews. IEEE Intellgent Systems 22(3), (2007) 9. Mller, G., Beckwth, R., Fellbaum, C., Gross, D., Mller, K.: Introducton to WordNet: An Onlne Lexcal Database. Internatonal Journal of Lexcography (Specal Issue) 3(4), (1990) 10. Pawlak, Z.: Rough Sets and Intellgent Data Analyss. Informaton Scence 147(1-4), 1 12 (2002) 11. Øhrn, A.: ROSETTA Techncal Reference Manual. Department of Computer and Informaton Scence, Norwegan Unversty of Scence and Technology (NTNU), Trondhem, Norway (2000)

Query Clustering Using a Hybrid Query Similarity Measure

Query Clustering Using a Hybrid Query Similarity Measure Query clusterng usng a hybrd query smlarty measure Fu. L., Goh, D.H., & Foo, S. (2004). WSEAS Transacton on Computers, 3(3), 700-705. Query Clusterng Usng a Hybrd Query Smlarty Measure Ln Fu, Don Hoe-Lan

More information

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems A Unfed Framework for Semantcs and Feature Based Relevance Feedback n Image Retreval Systems Ye Lu *, Chunhu Hu 2, Xngquan Zhu 3*, HongJang Zhang 2, Qang Yang * School of Computng Scence Smon Fraser Unversty

More information

Available online at Available online at Advanced in Control Engineering and Information Science

Available online at   Available online at   Advanced in Control Engineering and Information Science Avalable onlne at wwwscencedrectcom Avalable onlne at wwwscencedrectcom Proceda Proceda Engneerng Engneerng 00 (2011) 15000 000 (2011) 1642 1646 Proceda Engneerng wwwelsevercom/locate/proceda Advanced

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points; Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features

More information

User Tweets based Genre Prediction and Movie Recommendation using LSI and SVD

User Tweets based Genre Prediction and Movie Recommendation using LSI and SVD User Tweets based Genre Predcton and Move Recommendaton usng LSI and SVD Saksh Bansal, Chetna Gupta Department of CSE/IT Jaypee Insttute of Informaton Technology,sec-62 Noda, Inda sakshbansal76@gmal.com,

More information

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson

More information

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for

More information

FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK

FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK L-qng Qu, Yong-quan Lang 2, Jng-Chen 3, 2 College of Informaton Scence and Technology, Shandong Unversty of Scence and Technology,

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,

More information

The Research of Support Vector Machine in Agricultural Data Classification

The Research of Support Vector Machine in Agricultural Data Classification The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou

More information

Recommended Items Rating Prediction based on RBF Neural Network Optimized by PSO Algorithm

Recommended Items Rating Prediction based on RBF Neural Network Optimized by PSO Algorithm Recommended Items Ratng Predcton based on RBF Neural Network Optmzed by PSO Algorthm Chengfang Tan, Cayn Wang, Yuln L and Xx Q Abstract In order to mtgate the data sparsty and cold-start problems of recommendaton

More information

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto

More information

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A New Approach For the Ranking of Fuzzy Sets With Different Heights New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays

More information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth

More information

Virtual Machine Migration based on Trust Measurement of Computer Node

Virtual Machine Migration based on Trust Measurement of Computer Node Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on

More information

CORE: A Tool for Collaborative Ontology Reuse and Evaluation

CORE: A Tool for Collaborative Ontology Reuse and Evaluation CRE: A Tool for Collaboratve ntology Reuse and Evaluaton Mram Fernández, Iván Cantador, Pablo Castells Escuela Poltécnca Superor Unversdad Autónoma de Madrd Campus de Cantoblanco, 28049 Madrd, Span {mram.fernandez,

More information

Performance Evaluation of Information Retrieval Systems

Performance Evaluation of Information Retrieval Systems Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence

More information

Classifier Selection Based on Data Complexity Measures *

Classifier Selection Based on Data Complexity Measures * Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning the Kernel Parameters in Kernel Minimum Distance Classifier Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

The Effect of Similarity Measures on The Quality of Query Clusters

The Effect of Similarity Measures on The Quality of Query Clusters The effect of smlarty measures on the qualty of query clusters. Fu. L., Goh, D.H., Foo, S., & Na, J.C. (2004). Journal of Informaton Scence, 30(5) 396-407 The Effect of Smlarty Measures on The Qualty of

More information

Determining Fuzzy Sets for Quantitative Attributes in Data Mining Problems

Determining Fuzzy Sets for Quantitative Attributes in Data Mining Problems Determnng Fuzzy Sets for Quanttatve Attrbutes n Data Mnng Problems ATTILA GYENESEI Turku Centre for Computer Scence (TUCS) Unversty of Turku, Department of Computer Scence Lemmnkäsenkatu 4A, FIN-5 Turku

More information

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z. TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of

More information

Concurrent Apriori Data Mining Algorithms

Concurrent Apriori Data Mining Algorithms Concurrent Apror Data Mnng Algorthms Vassl Halatchev Department of Electrcal Engneerng and Computer Scence York Unversty, Toronto October 8, 2015 Outlne Why t s mportant Introducton to Assocaton Rule Mnng

More information

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

More information

Related-Mode Attacks on CTR Encryption Mode

Related-Mode Attacks on CTR Encryption Mode Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

Learning-Based Top-N Selection Query Evaluation over Relational Databases

Learning-Based Top-N Selection Query Evaluation over Relational Databases Learnng-Based Top-N Selecton Query Evaluaton over Relatonal Databases Lang Zhu *, Wey Meng ** * School of Mathematcs and Computer Scence, Hebe Unversty, Baodng, Hebe 071002, Chna, zhu@mal.hbu.edu.cn **

More information

UB at GeoCLEF Department of Geography Abstract

UB at GeoCLEF Department of Geography   Abstract UB at GeoCLEF 2006 Mguel E. Ruz (1), Stuart Shapro (2), June Abbas (1), Slva B. Southwck (1) and Davd Mark (3) State Unversty of New York at Buffalo (1) Department of Lbrary and Informaton Studes (2) Department

More information

A User Selection Method in Advertising System

A User Selection Method in Advertising System Int. J. Communcatons, etwork and System Scences, 2010, 3, 54-58 do:10.4236/jcns.2010.31007 Publshed Onlne January 2010 (http://www.scrp.org/journal/jcns/). A User Selecton Method n Advertsng System Shy

More information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges

More information

Feature Selection as an Improving Step for Decision Tree Construction

Feature Selection as an Improving Step for Decision Tree Construction 2009 Internatonal Conference on Machne Learnng and Computng IPCSIT vol.3 (2011) (2011) IACSIT Press, Sngapore Feature Selecton as an Improvng Step for Decson Tree Constructon Mahd Esmael 1, Fazekas Gabor

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

A CALCULATION METHOD OF DEEP WEB ENTITIES RECOGNITION

A CALCULATION METHOD OF DEEP WEB ENTITIES RECOGNITION A CALCULATION METHOD OF DEEP WEB ENTITIES RECOGNITION 1 FENG YONG, DANG XIAO-WAN, 3 XU HONG-YAN School of Informaton, Laonng Unversty, Shenyang Laonng E-mal: 1 fyxuhy@163.com, dangxaowan@163.com, 3 xuhongyan_lndx@163.com

More information

Keyword-based Document Clustering

Keyword-based Document Clustering Keyword-based ocument lusterng Seung-Shk Kang School of omputer Scence Kookmn Unversty & AIrc hungnung-dong Songbuk-gu Seoul 36-72 Korea sskang@kookmn.ac.kr Abstract ocument clusterng s an aggregaton of

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

A Method of Hot Topic Detection in Blogs Using N-gram Model

A Method of Hot Topic Detection in Blogs Using N-gram Model 84 JOURNAL OF SOFTWARE, VOL. 8, NO., JANUARY 203 A Method of Hot Topc Detecton n Blogs Usng N-gram Model Xaodong Wang College of Computer and Informaton Technology, Henan Normal Unversty, Xnxang, Chna

More information

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents

More information

Detection of an Object by using Principal Component Analysis

Detection of an Object by using Principal Component Analysis Detecton of an Object by usng Prncpal Component Analyss 1. G. Nagaven, 2. Dr. T. Sreenvasulu Reddy 1. M.Tech, Department of EEE, SVUCE, Trupath, Inda. 2. Assoc. Professor, Department of ECE, SVUCE, Trupath,

More information

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research

More information

Keywords - Wep page classification; bag of words model; topic model; hierarchical classification; Support Vector Machines

Keywords - Wep page classification; bag of words model; topic model; hierarchical classification; Support Vector Machines (IJCSIS) Internatonal Journal of Computer Scence and Informaton Securty, Herarchcal Web Page Classfcaton Based on a Topc Model and Neghborng Pages Integraton Wongkot Srura Phayung Meesad Choochart Haruechayasak

More information

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

More information

LinkSelector: A Web Mining Approach to. Hyperlink Selection for Web Portals

LinkSelector: A Web Mining Approach to. Hyperlink Selection for Web Portals nkselector: A Web Mnng Approach to Hyperlnk Selecton for Web Portals Xao Fang and Olva R. u Sheng Department of Management Informaton Systems Unversty of Arzona, AZ 8572 {xfang,sheng}@bpa.arzona.edu Submtted

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty

More information

Recommendations of Personal Web Pages Based on User Navigational Patterns

Recommendations of Personal Web Pages Based on User Navigational Patterns nternatonal Journal of Machne Learnng and Computng, Vol. 4, No. 4, August 2014 Recommendatons of Personal Web Pages Based on User Navgatonal Patterns Yn-Fu Huang and Ja-ang Jhang Abstract n ths paper,

More information

Classifying Acoustic Transient Signals Using Artificial Intelligence

Classifying Acoustic Transient Signals Using Artificial Intelligence Classfyng Acoustc Transent Sgnals Usng Artfcal Intellgence Steve Sutton, Unversty of North Carolna At Wlmngton (suttons@charter.net) Greg Huff, Unversty of North Carolna At Wlmngton (jgh7476@uncwl.edu)

More information

Machine Learning: Algorithms and Applications

Machine Learning: Algorithms and Applications 14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of

More information

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.

More information

Document Representation and Clustering with WordNet Based Similarity Rough Set Model

Document Representation and Clustering with WordNet Based Similarity Rough Set Model IJCSI Internatonal Journal of Computer Scence Issues, Vol. 8, Issue 5, No 3, September 20 ISSN (Onlne): 694-084 www.ijcsi.org Document Representaton and Clusterng wth WordNet Based Smlarty Rough Set Model

More information

CAN COMPUTERS LEARN FASTER? Seyda Ertekin Computer Science & Engineering The Pennsylvania State University

CAN COMPUTERS LEARN FASTER? Seyda Ertekin Computer Science & Engineering The Pennsylvania State University CAN COMPUTERS LEARN FASTER? Seyda Ertekn Computer Scence & Engneerng The Pennsylvana State Unversty sertekn@cse.psu.edu ABSTRACT Ever snce computers were nvented, manknd wondered whether they mght be made

More information

Classic Term Weighting Technique for Mining Web Content Outliers

Classic Term Weighting Technique for Mining Web Content Outliers Internatonal Conference on Computatonal Technques and Artfcal Intellgence (ICCTAI'2012) Penang, Malaysa Classc Term Weghtng Technque for Mnng Web Content Outlers W.R. Wan Zulkfel, N. Mustapha, and A. Mustapha

More information

Scheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research

Scheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research Schedulng Remote Access to Scentfc Instruments n Cybernfrastructure for Educaton and Research Je Yn 1, Junwe Cao 2,3,*, Yuexuan Wang 4, Lanchen Lu 1,3 and Cheng Wu 1,3 1 Natonal CIMS Engneerng and Research

More information

Extraction of User Preferences from a Few Positive Documents

Extraction of User Preferences from a Few Positive Documents Extracton of User Preferences from a Few Postve Documents Byeong Man Km, Qng L Dept. of Computer Scences Kumoh Natonal Insttute of Technology Kum, kyungpook, 730-70,South Korea (Bmkm, lqng)@se.kumoh.ac.kr

More information

User Authentication Based On Behavioral Mouse Dynamics Biometrics

User Authentication Based On Behavioral Mouse Dynamics Biometrics User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA

More information

Semantic Image Retrieval Using Region Based Inverted File

Semantic Image Retrieval Using Region Based Inverted File Semantc Image Retreval Usng Regon Based Inverted Fle Dengsheng Zhang, Md Monrul Islam, Guoun Lu and Jn Hou 2 Gppsland School of Informaton Technology, Monash Unversty Churchll, VIC 3842, Australa E-mal:

More information

An Image Fusion Approach Based on Segmentation Region

An Image Fusion Approach Based on Segmentation Region Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

Utilizing Content to Enhance a Usage-Based Method for Web Recommendation based on Q-Learning

Utilizing Content to Enhance a Usage-Based Method for Web Recommendation based on Q-Learning Proceedngs of the Twenty-Frst Internatonal FLAIS Conference (2008) Utlzng Content to Enhance a Usage-Based Method for Web ecommendaton based on Q-Learnng Nma Taghpour Department of Computer Engneerng Amrkabr

More information

A Hybrid Text Classification System Using Sentential Frequent Itemsets

A Hybrid Text Classification System Using Sentential Frequent Itemsets A Hybrd Text Classfcaton System Usng Sentental Frequent Itemsets Shzhu Lu, Hepng Hu College of Computer Scence, Huazhong Unversty of Scence and Technology, Wuhan 430074, Chna stoneboo@26.com Abstract:

More information

A high precision collaborative vision measurement of gear chamfering profile

A high precision collaborative vision measurement of gear chamfering profile Internatonal Conference on Advances n Mechancal Engneerng and Industral Informatcs (AMEII 05) A hgh precson collaboratve vson measurement of gear chamferng profle Conglng Zhou, a, Zengpu Xu, b, Chunmng

More information

Web Document Classification Based on Fuzzy Association

Web Document Classification Based on Fuzzy Association Web Document Classfcaton Based on Fuzzy Assocaton Choochart Haruechayasa, Me-Lng Shyu Department of Electrcal and Computer Engneerng Unversty of Mam Coral Gables, FL 33124, USA charuech@mam.edu, shyu@mam.edu

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and

More information

F Geometric Mean Graphs

F Geometric Mean Graphs Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 2 (December 2015), pp. 937-952 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) F Geometrc Mean Graphs A.

More information

Ranking Techniques for Cluster Based Search Results in a Textual Knowledge-base

Ranking Techniques for Cluster Based Search Results in a Textual Knowledge-base Rankng Technques for Cluster Based Search Results n a Textual Knowledge-base Shefal Sharma Fetch Technologes, Inc 841 Apollo St, El Segundo, CA 90254 +1 (310) 414-9849 ssharma@fetch.com Sofus A. Macskassy

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

CS47300: Web Information Search and Management

CS47300: Web Information Search and Management CS47300: Web Informaton Search and Management Prof. Chrs Clfton 15 September 2017 Materal adapted from course created by Dr. Luo S, now leadng Albaba research group Retreval Models Informaton Need Representaton

More information

An Item-Targeted User Similarity Method for Data Service Recommendation

An Item-Targeted User Similarity Method for Data Service Recommendation 01 IEEE 16th Internatonal Enterprse Dstrbuted Object Computng Conference Workshops An Item-Targeted User Smlarty Method for Data Serce Recommendaton Cheng Zhang, Xaofang Zhao Insttute of Computng Technology

More information

Pruning Training Corpus to Speedup Text Classification 1

Pruning Training Corpus to Speedup Text Classification 1 Prunng Tranng Corpus to Speedup Text Classfcaton Jhong Guan and Shugeng Zhou School of Computer Scence, Wuhan Unversty, Wuhan, 430079, Chna hguan@wtusm.edu.cn State Key Lab of Software Engneerng, Wuhan

More information

Problem Set 3 Solutions

Problem Set 3 Solutions Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,

More information

Relevance Feedback for Image Retrieval

Relevance Feedback for Image Retrieval Vashal D Dhale et al, / (IJCSIT Internatonal Journal of Computer Scence and Informaton Technologes, Vol 4 (2, 203, 39-323 Relevance Feedback for Image Retreval Vashal D Dhale, Dr A R Mahaan, Prof Uma Thakur

More information

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan

More information

Domain Thesaurus Construction from Wikipedia *

Domain Thesaurus Construction from Wikipedia * Internatonal Conference on Computer, Networks and Communcaton Engneerng (ICCNCE 2013) Doman Thesaurus Constructon from Wkpeda * WenKe Yn 1, Mng Zhu 2, TanHao Chen 2 1 Department of Electronc Engneerng

More information

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques

More information

Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier

Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier Some materal adapted from Mohamed Youns, UMBC CMSC 611 Spr 2003 course sldes Some materal adapted from Hennessy & Patterson / 2003 Elsever Scence Performance = 1 Executon tme Speedup = Performance (B)

More information

On-line Hot Topic Recommendation Using Tolerance Rough Set Based Topic Clustering

On-line Hot Topic Recommendation Using Tolerance Rough Set Based Topic Clustering JOURNAL OF COMPUTERS, VOL. 5, NO. 4, APRIL 2010 549 On-lne Hot Topc Recommendaton Usng Tolerance Rough Set Based Topc Clusterng Yonghu Wu, Yuxn Dng, Xaolong Wang, Jun Xu Intellgence Computng Research Center

More information

Recommender System based on Higherorder Logic Data Representation

Recommender System based on Higherorder Logic Data Representation Recommender System based on Hgherorder Logc Data Representaton Lnna L Bngru Yang Zhuo Chen School of Informaton Engneerng, Unversty Of Scence and Technology Bejng Abstract Collaboratve Flterng help users

More information

Alignment Results of SOBOM for OAEI 2010

Alignment Results of SOBOM for OAEI 2010 Algnment Results of SOBOM for OAEI 2010 Pegang Xu, Yadong Wang, Lang Cheng, Tany Zang School of Computer Scence and Technology Harbn Insttute of Technology, Harbn, Chna pegang.xu@gmal.com, ydwang@ht.edu.cn,

More information

Fuzzy C-Means Initialized by Fixed Threshold Clustering for Improving Image Retrieval

Fuzzy C-Means Initialized by Fixed Threshold Clustering for Improving Image Retrieval Fuzzy -Means Intalzed by Fxed Threshold lusterng for Improvng Image Retreval NAWARA HANSIRI, SIRIPORN SUPRATID,HOM KIMPAN 3 Faculty of Informaton Technology Rangst Unversty Muang-Ake, Paholyotn Road, Patumtan,

More information

Constructing Minimum Connected Dominating Set: Algorithmic approach

Constructing Minimum Connected Dominating Set: Algorithmic approach Constructng Mnmum Connected Domnatng Set: Algorthmc approach G.N. Puroht and Usha Sharma Centre for Mathematcal Scences, Banasthal Unversty, Rajasthan 304022 usha.sharma94@yahoo.com Abstract: Connected

More information

Decision Strategies for Rating Objects in Knowledge-Shared Research Networks

Decision Strategies for Rating Objects in Knowledge-Shared Research Networks Decson Strateges for Ratng Objects n Knowledge-Shared Research etwors ALEXADRA GRACHAROVA *, HAS-JOACHM ER **, HASSA OUR ELD ** OM SUUROE ***, HARR ARAKSE *** * nsttute of Control and System Research,

More information

A Generation Model to Unify Topic Relevance and Lexicon-based Sentiment for Opinion Retrieval

A Generation Model to Unify Topic Relevance and Lexicon-based Sentiment for Opinion Retrieval A Generaton Model to Unfy Topc Relevance and Lexcon-based Sentment for Opnon Retreval Mn Zhang State key lab of Intellgent Tech.& Sys, Dept. of Computer Scence, Tsnghua Unversty, Bejng, 00084, Chna 86-0-6279-2595

More information

Implementation Naïve Bayes Algorithm for Student Classification Based on Graduation Status

Implementation Naïve Bayes Algorithm for Student Classification Based on Graduation Status Internatonal Journal of Appled Busness and Informaton Systems ISSN: 2597-8993 Vol 1, No 2, September 2017, pp. 6-12 6 Implementaton Naïve Bayes Algorthm for Student Classfcaton Based on Graduaton Status

More information

Combining Multiple Resources, Evidence and Criteria for Genomic Information Retrieval

Combining Multiple Resources, Evidence and Criteria for Genomic Information Retrieval Combnng Multple Resources, Evdence and Crtera for Genomc Informaton Retreval Luo S 1, Je Lu 2 and Jame Callan 2 1 Department of Computer Scence, Purdue Unversty, West Lafayette, IN 47907, USA ls@cs.purdue.edu

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining the Optimal Bandwidth Based on Multi-criterion Fusion Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn

More information

Behavioral Model Extraction of Search Engines Used in an Intelligent Meta Search Engine

Behavioral Model Extraction of Search Engines Used in an Intelligent Meta Search Engine Behavoral Model Extracton of Search Engnes Used n an Intellgent Meta Search Engne AVEH AVOUSI Computer Department, Azad Unversty, Garmsar Branch BEHZAD MOSHIRI Electrcal and Computer department, Faculty

More information

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following. Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal

More information

Adapting Ratings in Memory-Based Collaborative Filtering using Linear Regression

Adapting Ratings in Memory-Based Collaborative Filtering using Linear Regression Adaptng Ratngs n Memory-Based Collaboratve Flterng usng Lnear Regresson Jérôme Kunegs, Şahn Albayrak Technsche Unverstät Berln DAI-Labor Franklnstraße 8/9 10587 Berln, Germany {kunegs,sahn.albayrak}@da-labor.de

More information

A CO-TRAINING METHOD FOR IDENTIFYING THE SAME PERSON ACROSS SOCIAL NETWORKS

A CO-TRAINING METHOD FOR IDENTIFYING THE SAME PERSON ACROSS SOCIAL NETWORKS A CO-TRAINING METHOD FOR IDENTIFYING THE SAME PERSON ACROSS SOCIAL NETWORKS Zheng Fang 1,2, Yanan Cao 2, Yanmn Shang 2, Yanbng Lu 2, Janlong Tan 2, L Guo 2 1 School of Cyber Securty, Unversty of Chnese

More information

Improving the Quality of Information Retrieval Using Syntactic Analysis of Search Query

Improving the Quality of Information Retrieval Using Syntactic Analysis of Search Query Improvng the Qualty of Informaton Retreval Usng Syntactc Analyss of Search Query Nadezhda Yarushkna 1[0000-0002-5718-8732], Aleksey Flppov 1[0000-0003-0008-5035], and Mara Grgorcheva 1[0000-0001-7492-5178]

More information

CUM: An Efficient Framework for Mining Concept Units

CUM: An Efficient Framework for Mining Concept Units 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 575025 santh_soc@yahoo.co.n,

More information

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

More information

Deep Classification in Large-scale Text Hierarchies

Deep Classification in Large-scale Text Hierarchies Deep Classfcaton n Large-scale Text Herarches Gu-Rong Xue Dkan Xng Qang Yang 2 Yong Yu Dept. of Computer Scence and Engneerng Shangha Jao-Tong Unversty {grxue, dkxng, yyu}@apex.sjtu.edu.cn 2 Hong Kong

More information

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc. [Type text] [Type text] [Type text] ISSN : 0974-74 Volume 0 Issue BoTechnology 04 An Indan Journal FULL PAPER BTAIJ 0() 04 [684-689] Revew on Chna s sports ndustry fnancng market based on market -orented

More information

Assessing the Value of Unrated Items in Collaborative Filtering

Assessing the Value of Unrated Items in Collaborative Filtering Assessng the Value of Unrated Items n Collaboratve Flterng Jérôme Kunegs, Andreas Lommatzsch, Martn Mehltz, Şahn Albayrak Technsche Unverstät Berln DAI-Labor Ernst-Reuter-Platz 7, 0587 Berln, Germany {kunegs,andreas.lommatzsch,martn.mehltz,sahn.albayrak}@da-labor.de

More information

Solving two-person zero-sum game by Matlab

Solving two-person zero-sum game by Matlab Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by

More information

Ranking Search Results by Web Quality Dimensions

Ranking Search Results by Web Quality Dimensions Rankng Search Results by Web Qualty Dmensons Joshua C. C. Pun Department of Computer Scence HKUST Clear Water Bay, Kowloon Hong Kong punjcc@cs.ust.hk Frederck H. Lochovsky Department of Computer Scence

More information

Hermite Splines in Lie Groups as Products of Geodesics

Hermite Splines in Lie Groups as Products of Geodesics Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the

More information