A Novel Distributed Collaborative Filtering Algorithm and Its Implementation on P2P Overlay Network*
|
|
- Harry Collins
- 6 years ago
- Views:
Transcription
1 A Novel Dstrbuted Collaboratve Flterng Algorthm and Its Implementaton on P2P Overlay Network* Peng Han, Bo Xe, Fan Yang, Jajun Wang, and Rumn Shen Department of Computer Scence and Engneerng, Shangha Jao Tong Unversty, Shangha , Chna Abstract. Collaboratve flterng (CF) has proved to be one of the most effectve nformaton flterng technques. However, as ther calculaton complexty ncreased quckly both n tme and space when the record n user database ncreases, tradtonal centralzed CF algorthms has suffered from ther shortage n scalablty. In ths paper, we frst propose a novel dstrbuted CF algorthm called PpeCF through whch we can do both the user database management and predcton task n a decentralzed way. We then propose two novel approaches: sgnfcance refnement (SR) and unanmous amplfcaton (UA), to further mprove the scalablty and predcton accuracy of PpeCF. Fnally we gve the algorthm framework and system archtecture of the mplementaton of PpeCF on Peer-to-Peer (P2P) overlay network through dstrbuted hash table (DHT) method, whch s one of the most popular and effectve routng algorthm n P2P. The expermental data show that our dstrbuted CF algorthm has much better scalablty than tradtonal centralzed ones wth comparable predcton effcency and accuracy. 1 Introducton Collaboratve flterng (CF) has proved to be one of the most effectve nformaton flterng technques snce Goldberg et al [1] publshed the frst account of usng t for nformaton flterng. Unlke content-based flterng, the key dea of CF s that users wll prefer those tems that people wth smlar nterests prefer, or even that dssmlar people don t prefer. The k-nearest Neghbor (KNN) method s a popular realzaton of CF for ts smplcty and reasonable performance. Up to now, many successful applcatons have been bult on t such as GroupLens [4], Rngo [5]. However, as ts computaton complexty ncreased quckly both n tme and space as the record n the database ncreases, KNN-based CF algorthm suffered a lot from ts shortage n scalablty. One way to avod the recommendaton-tme computatonal complexty of a KNN method s to use a model-based method that uses the users preferences to learn a model, whch s then used for predcatons. Breese et al utlzes clusterng and Bayesan network for a model-based CF algorthm n [3]. Its results show that the clusterng-based method s the more effcent but sufferng from poor accuracy whle * Supported by the Natonal Natural Scence Foundaton of Chna under Grant No H. Da, R. Srkant, and C. Zhang (Eds.): PAKDD 2004, LNAI 3056, pp , 2004 Sprnger-Verlag Berln Hedelberg 2004
2 A Novel Dstrbuted Collaboratve Flterng Algorthm and Its Implementaton 107 the Bayesan networks prove only practcal for envronments n whch knowledge of user preferences changes slowly. Further more, all model-based CF algorthms stll requre a central database to keep all the user data whch s not easy to acheve sometme not only for technques reasons but also for prvacy reasons. An alternatve way to address the computatonal complexty s to mplement KNN algorthm n a dstrbuted manner. As Peer-to-Peer (P2P) overlay network gans more and more popularty for ts advantage n scalablty, some researchers have already begun to consder t as an alternatve archtecture [7,8,9] of centralzed CF recommender system. These methods ncrease the scalablty of CF recommender system dramatcally. However, as they used a totally dfferent mechansm to fnd approprate neghbors than KNN algorthms, ther performance s hard to analyze and may be affected by many other factors such as network condton and selforganzaton scheme. In ths paper we solve the scalablty problem of KNN-based CF algorthm by proposng a novel dstrbuted CF algorthm called PpeCF whch has the followng advantage: 1. In PpeCF, both the user database management and predcton computaton task can be done n a decentralzed way whch ncreases the algorthm s scalablty dramatcally. 2. PpeCF keeps all the other features of tradtonal KNN CF algorthm so that the system s performance can be analyzed both emprcally and theoretcally and the mprovement on tradtonal KNN algorthm can also be appled here. 3. Two novel approaches have been proposed n PpeCF to further mprove the predcton and scalablty of KNN CF algorthm and reduce the calculaton complexty from to where M s the user number n the database and N s the tems number. 4. By desgnng a heurstc user database dvson strategy, the mplementaton of PpeCF on a dstrbuted-hash-table (DHT) based P2P overlay network s qute straghtforward whch can obtan effcent user database management and retreval at the same tme. The rest of ths paper s organzed as follows. In Secton 2, several related works are presented and dscussed. In Secton 3, we gve the archtecture and key features of PpeCF. Two technques: SR and UA are also proposed n ths secton. We then gve the mplementaton of PpeCF on a DHT-based P2P overlay network n Secton 4. In Secton 5 the expermental results of our system are presented and analyzed. Fnally we make a bref concludng remark and gve the future work n Secton 6. 2 Related Works 2.1 Basc KNN-Based CF Algorthm Generally, the task of CF s to predct the votes of actve users from the user database whch conssts of a set of votes correspondng to the vote of user on tem j. The KNN-based CF algorthm calculates ths predcton as a weghted average of other users votes on that tem through the followng formula:
3 108 P. Han et al. n a, j = va + κ ϖ ( a, j)( v, j v ) = 1 P (1) P, Where a j denotes the predcton of the vote for actve user a on tem j and n s the number of users n user database. v s the mean vote for user as: Where 1 (2) v = v, j I j I I s the set of tems on whch user has voted. The weghts ϖ ( a, j) reflect the smlarty between actve user and users n the user database. κ s a normalzng factor to make the absolute values of the weghts sum to unty. 2.2 P2P System and DHT Routng Algorthm The term Peer-to-Peer refers to a class of systems and applcatons that employ dstrbuted resources to perform a crtcal functon n a decentralzed manner. Some of the benefts of a P2P approach nclude: mprovng scalablty by avodng dependency on centralzed ponts; elmnatng the need for costly nfrastructure by enablng drect communcaton among clents. As the man purpose of P2P systems are to share resources among a group of computers called peers n a dstrbuted way, effcent and robust routng algorthms for locatng wanted resource s crtcal to the performance of P2P systems. Among these algorthms, dstrbuted hash table (DHT) algorthm s one of the most popular and effectve and supported by many P2P systems such as CAN [10], Chord [11], Pastry [12], and Tapestry [13]. A DHT overlay network s composed of several DHT nodes and each node keeps a set of resources (e.g., fles, ratng of tems). Each resource s assocated wth a key (produced, for nstance, by hashng the fle name) and each node n the system s responsble for storng a certan range of keys. Peers n the DHT overlay network locate ther wanted resource by ssue a lookup(key) request whch returns the dentty (e.g., the IP address) of the node that stores the resource wth the certan key. The prmary goals of DHT are to provde an effcent, scalable, and robust routng algorthm whch ams at reducng the number of P2P hops, whch are nvolved when we locate a certan resource, and to reduce the amount of routng state that should be preserved at each peer. 3 PpeCF: A Novel Dstrbuted CF Algorthm 3.1 Basc PpeCF Algorthm The frst step to mplement CF algorthm n a dstrbuted way s to dvde the orgnal centralzed user database nto fractons whch can then be stored n dstrbuted peers. For concson, we wll use the term bucket to denote the dstrbuted stored fracton of
4 A Novel Dstrbuted Collaboratve Flterng Algorthm and Its Implementaton 109 user database n the followng of ths paper. Here, two crtcal problems should be consdered. The frst one s how to assgn each bucket wth a unque dentfer through whch they can be effcently located. The second s whch bucket should be retreved when we need to make predcton for a partcular user. Here, we solve the frst problem by proposng a dvson strategy whch makes each bucket hold a group of users record who has a partcular <ITEM_ID, VOTE> tuple. It means that users n the same bucket at least voted one tem wth the same ratng. Ths <ITEM_ID, VOTE> wll then be used to a unque key as the dentfer for the bucket n the network whch we wll descrbe n more detal n Secton 4. To solve the second problem, we propose a heurstc bucket choosng strategy by only retrevng those buckets whose dentfers are the same wth those generated by the actve user s ratngs. Fgure 1 gves the framework of PpeCF. Detals of the functon of lookup(key) and mplementon of PpeCF on DHT-based P2P overlay network wll be descrbed n Secton 4. The bucket choosng strategy of PpeCF s based on the assumpton that people wth smlar nterests wll at least rate one tem wth smlar votes. So when makng predcton, PpeCF only uses those users records that are n the same bucket wth the actve user. As we can see n Fgure 5 of secton 5.3.1, ths strategy have very hgh httng rato. Stll, we can see that through ths strategy we reduce about 50% calculaton than tradtonal CF algorthm and obtan comparable predcton as shown n Fgure 6 and 7 n secton 5. Algorthm: PpeCF Input: ratng record of the actve user, target tem Output: predctve ratng for target tem Method: For Each <ITEM_ID, VOTE> tuple n the ratng record of actve user: 1) Generate the key correspondng to the <ITEM_ID, VOTE> through the hash algorthm used by DHT 2) Fnd the host whch holds the bucket wth the dentfer key through the functon lookup(key) provded by DHT 3) Copy all ratngs n bucket key to current host Use tradtonal KNN-based CF algorthm to calculate to predctve ratng for target tem. Fg. 1. Framework of PpeCF 3.2 Some Improvement Sgnfcance Refnement (SR) In the basc PpeCF algorthm, we return all users whch are n the at least one same bucket wth the actve user and fnd that the algorthm has an O(N) fetched user number where N s the total user number as Fgure 7 shows. In fact, as Breese presented n [3] by the term nverse user frequency, unversally lked tems are not as useful as less common tems n capturng smlarty. So we ntroduce a new concept sgnfcance refnement (SR) whch reduces the returned user number of the basc PpeCF algorthm by lmtng the number of returned users for each bucket. We term
5 110 P. Han et al. the algorthm mproved by SR as Return K whch means for every tem, the PpeCF algorthm returns no more than K users for each bucket. The expermental result n Fgure 7 and 8 of secton shows that ths method reduces the returned user number dramatcally and also mproves the predcton accuracy Unanmous Amplfcaton (UA) In our experment n KNN-based CF algorthm, we have found that some hghly correlated neghbors have lttle tems on whch they vote the same ratng wth the actve users. These neghbors frequently prove to have worse predcton accuracy than those neghbors who have same ratng wth actve users but relatvely lower correlaton. So we argue that we should gve specal award to the users who rated some tems wth the same vote by amplfy ther weghts, whch we term Unanmous Amplfcaton. We transform the estmated weghts as follows: Where a wa, N a, = 0 w a, = wa, α 0 < N a, γ wa, β N a, > γ N, denotes the number of tems whch user a and user have the same votes. A typcal value for α for our experments s 2.0, β s 4.0, and γ s 4. Expermental result n Fgure 9 of secton shows that UA approach mproves the predcton accuracy of the PpeCF algorthm. (3) 4 Implementon of PpeCF on a DHT-Based P2P Overlay Network 4.1 System Archtecture Fgure 2 gves the system archtecture of our mplementaton of PpeCF on the DHTbased P2P overlay network. Here, we vew the users ratng as resources and the system generate a unque key for each partcular <ITEM_ID, VOTE> tuple through the hash algorthm, where the ITEM_ID denotes dentty of the tem user votes on and VOTE s the user s ratng on that tem. As dfferent users may vote partcular tem wth same ratng, each key wll correspond to a set of users who have the same <ITEM_ID, VOTE> tuple. As we stated n secton 3, we call such set of users record as bucket. As we can see n Fgure 2, each peer n the dstrbuted CF system s responsble for storng one or several buckets. Peers are connected through a DHTbased P2P overlay network. Peers can fnd ther wanted buckets by ther keys effcently through the DHT-based routng algorthm. As we can see from Fgure 1 and Fgure 2, the mplementaton of our PpeCF on DHT-based P2P overlay network s qute straghtforward except two key peces: how to store the buckets and fetch them back effectvely n ths dstrbuted envronment. We solve these problems through two fundamental DHT functon: put(key) and lookup(key) whch are descrbed n Fgure 3 and Fgure 4 respectvely.
6 A Novel Dstrbuted Collaboratve Flterng Algorthm and Its Implementaton 111 These two functons nhert from DHT the followng merts: Scalablty: t must be desgned to scale to several mllon nodes. Effcency: smlar users should be located reasonably quck and wth low overhead n terms of the message traffc generated. Dynamcty: the system should be robust to frequent node arrvals and departures n order to cope wth hghly transent user populatons characterstc to decentralzed envronments. Balanced load: n keepng wth the decentralzed nature, the total resource load (traffc, storage, etc) should be roughly balanced across all the nodes n the system. Fg. 2. System Archtecture of Dstrbuted CF Recommender System 5 Expermental Results 5.1 Data Set We use EachMove data set [6] to evaluate the performance of mproved algorthm. The EachMove data set s provded by the Compaq System Research Center, whch ran the EachMove recommendaton servce for 18 months to experment wth a collaboratve flterng algorthm. The nformaton they gathered durng that perod conssts of 72,916 users, 1,628 moves, and 2,811,983 numerc ratngs rangng from 0 to 5. To speed up our experments, we only use a subset of the EachMove data set. 5.2 Metrcs and Methodology The metrcs for evaluatng the accuracy of we used here s statstcal accuracy metrcs whch evaluate the accuracy of a predctor by comparng predcted values wth userprovded values. More specfcally, we use Mean Absolute Error (MAE), a statstcal
7 112 P. Han et al. accuracy metrcs, to report predcton experments for t s most commonly used and easy to understand: MAE = a T a, j va, j p T Where v a, j s the ratng gven to tem j by user a, s the predcted value of user a on tem j, T s the test set, T s the sze of the test set. (4) Algorthm: DHT-based CF puts a peer P s vote vector to DHT overlay network Input: P s vote vector Output: NULL Method: For each <ITEM_ID, VOTE> n P s vote vector: 1) P generates a unque 128-bt DHT Key K local (.e. hash the system unque username). 2) P hashes ths <ITEM_ID, VOTE> tuple to key K, and routes t wth P s vote vector to the neghbor P whose local key K _local s the most smlar wth K. 3) When P receves the PUT message wth K, t caches t. And f the most smlar neghbor s not tself, t just routes the message to ts neghbor whose local key s most smlar wth K. Fg. 3. DHT Put(key) Functon Algorthm: lookup(key) Input: dentfer key of the targeted bucket Output: targeted bucket (retreved from other peers) Method: 1) Routes the key wth the targeted bucket to the neghbor P whose local key K _local s the most smlar wth K. 2) When P receves the LOOKUP message wth K, f P has enough cached vote vectors wth the same key K, t returns the vectors back to P, otherwse t just routes the message to ts neghbor whose local key s most smlar wth K. Anyway, P wll fnally get all the records n the bucket whose dentfer s key. Fg. 4. DHT Lookup(key) Functon We select 2000 users and choose one user as actve user per tme and the remander users as hs canddate neghbors, because every user only make self s recommendaton locally. We use the mean predcton accuracy of all the 2000 users as the system's predcton accuracy. For every user s recommendaton calculaton, our tests are performed usng 80% of the user s ratngs for tranng, wth the remander for testng.
8 A Novel Dstrbuted Collaboratve Flterng Algorthm and Its Implementaton Expermental Result We desgn several experments for evaluatng our algorthm and analyze the effect of varous factors (e.g., SR and UA, etc) by comparson. All our experments are run on a Wndows 2000 based PC wth Intel Pentum 4 processor havng a speed of 1.8 GHz and 512 MB of RAM The Effcency of Neghbor Choosng We used a data set of 2000 users and show among the users chosen by PpeCF algorthm, how many are n the top-100 users n Fgure 5. We can see from the data that when the user number rses above 1000, more than 80 users who have the most smlartes wth the actve users are chosen by PpeCF algorthm. Fg. 5. How Many Users Chosen by PpeCF n Tradtonal CF s Top 100 Fg. 6. PpeCF vs. Tradtonal CF Performance Comparson We compare the predcton accuracy of tradtonal CF algorthm and PpeCF algorthm whle we apply both top-all and top-100 user selecton on them. The results are shown as Fgure 6. We can see that the DHT-based algorthm has better predcton accuracy than the tradtonal CF algorthm The Effect of Sgnfcance Refnement We lmt the number of returned user for each bucket by 2 and 5 and do the experment n Secton agan. The user for each bucket s chosen randomly. The result of the number of user chosen and the predcton accuracy s shown n Fgure 7 and Fgure 8 respectvely. The result shows: Return All has an O(N) returned user number and ts predcton accuracy s also not satsfyng; Return 2 has the least returned user number but the worst predcton accuracy; Return 5 has the best predcton accuracy and the scalablty s stll reasonably well (the returned user number s stll lmted to a constant as the total user number ncreases).
9 114 P. Han et al. Fg. 7. The Effect on Scalablty of SR on PpeCF Fg. 8. The Effect on Predcton Accuracy of SR on PpeCF Algorthm Fg. 9. The Effect on Predcton Accuracy of Unanmous Amplfcaton The Effect of Unanmous Amplfcaton We adjust the weghts for each user by usng Equaton (5) whle settng value for α as 2.0, β as 4.0, γ as 4 and do the experment n Secton agan. We use the top-100 and Return All selecton method. The result shows that the UA approach mproves the predcton accuracy of both the tradtonal and the PpeCF algorthm. From Fgure 9 we can see that when UA approach s appled, the two knds of algorthms have almost the same performance. 6 Concluson In ths paper, we solve the scalablty problem of KNN-based CF algorthm by proposng a novel dstrbuted CF algorthm called PpeCF and gve ts mplementaton on a DHT-based P2P overlay network. Two novel approaches: sgnfcance refnement (SR) and unanmous amplfcaton (UA) have been proposed to mprove
10 A Novel Dstrbuted Collaboratve Flterng Algorthm and Its Implementaton 115 the performance of dstrbuted CF algorthm. The expermental data show that our algorthm has much better scalablty than tradtonal KNN-based CF algorthm wth comparable predcton effcency. References 1. Davd Goldberg, Davd Nchols, Bran M. Ok, Douglas Terry.: Usng collaboratve flterng to weave an nformaton tapestry, Communcatons of the ACM, v.35 n.12, p.61-70, Dec J. L. Herlocker, J. A. Konstan, A. Borchers, and J. Redl.: An algorthmc framework for performng collaboratve flterng. In Proceedngs of the 22nd annual nternatonal ACM SIGIR conference on Research and development n nformaton retreval, pages , Breese, J., Heckerman, D., and Kade, C.: Emprcal Analyss of Predctve Algorthms for Collaboratve Flterng. Proceedngs of the 14th Conference on Uncertanty n Artfcal Intellgence, 1998 (43-52). 4. Paul Resnck, Neophytos Iacovou, Mtesh Suchak, Peter Bergstrom, John Redl.: GroupLens: an open archtecture for collaboratve flterng of netnews, Proceedngs of the 1994 ACM conference on Computer supported cooperatve work, p , October 22-26, 1994, Chapel Hll, North Carolna, Unted States. 5. Upendra Shardanand, Patte Maes.: Socal nformaton flterng: algorthms for automatng word of mouth, Proceedngs of the SIGCHI conference on Human factors n computng systems, p , May 07-11, 1995, Denver, Colorado, Unted States. 6. Eachmove collaboratve flterng data set.: 7. Amund Tvet.: Peer-to-peer based Recommendatons for Moble Commerce. Proceedngs of the Frst Internatonal Moble Commerce Workshop, ACM Press, Rome, Italy, July 2001, pp Tomas Olsson.: "Bootstrappng and Decentralzng Recommender Systems", Lcentate Thess , Department of Informaton Technology, Uppsala Unversty and SICS, J. Canny.: Collaboratve flterng wth prvacy. In Proceedngs of the IEEE Symposum on Research n Securty and Prvacy, pages , Oakland, CA, May IEEE Computer Socety, Techncal Commttee on Securty and Prvacy, IEEE Computer Socety Press. 10. S. Ratnasamy, P. Francs, M. Handley, R. Karp, and S. Shenker.: A scalable contentaddressable network. In SIGCOMM, Aug Stocal I et al.: Chord: A scalable peer-to-peer lookup servce for Internet applcatons (2001). In ACM SIGCOMM, San Dego, CA, USA, 2001, pp Rowstron A. Druschel P.: Pastry: Scalable, dstrbuted object locaton and routng for large scale peer-to-peer systems. In IFIP/ACM Mddleware, Hedelberg, Germany, Zhao B Y et al.: Tapestry: An nfrastructure for fault-tolerant wde-area locaton and routng. Tech.Rep.UCB/CSB-0-114,UC Berkeley, EECS,2001
An Efficient Neighbor Searching Scheme of Distributed Collaborative Filtering on P2P Overlay Network 1
An Efficient Neighbor Searching Scheme of Distributed Collaborative Filtering on P2P Overlay Network 1 Bo Xie, Peng Han, Fan Yang, Ruimin Shen Department of Computer Science and Engineering, Shanghai Jiao
More informationA 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 informationAn 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 informationContent 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 informationTerm 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 informationAdapting 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 informationParallelism 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 informationCluster 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 informationConcurrent 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 informationA 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 informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationRecommended 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 informationAn 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 informationLearning 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 informationAvailable 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 informationThe 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 informationImproved Resource Allocation Algorithms for Practical Image Encoding in a Ubiquitous Computing Environment
JOURNAL OF COMPUTERS, VOL. 4, NO. 9, SEPTEMBER 2009 873 Improved Resource Allocaton Algorthms for Practcal Image Encodng n a Ubqutous Computng Envronment Manxong Dong, Long Zheng, Kaoru Ota, Song Guo School
More informationX- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More informationRelated-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 informationVideo Proxy System for a Large-scale VOD System (DINA)
Vdeo Proxy System for a Large-scale VOD System (DINA) KWUN-CHUNG CHAN #, KWOK-WAI CHEUNG *# #Department of Informaton Engneerng *Centre of Innovaton and Technology The Chnese Unversty of Hong Kong SHATIN,
More informationVirtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory
Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process
More informationEfficient Distributed File System (EDFS)
Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate
More informationTsinghua 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 informationClassifier 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 informationSome 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 informationVirtual 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 informationSimulation Based Analysis of FAST TCP using OMNET++
Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months
More informationImprovement 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 informationRecommender 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 informationHermite 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 informationWishing 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 informationA 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 informationProblem 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 informationLoad-Balanced Anycast Routing
Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance
More informationMeta-heuristics for Multidimensional Knapsack Problems
2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,
More informationQuery 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 informationA KIND OF ROUTING MODEL IN PEER-TO-PEER NETWORK BASED ON SUCCESSFUL ACCESSING RATE
A KIND OF ROUTING MODEL IN PEER-TO-PEER NETWORK BASED ON SUCCESSFUL ACCESSING RATE 1 TAO LIU, 2 JI-JUN XU 1 College of Informaton Scence and Technology, Zhengzhou Normal Unversty, Chna 2 School of Mathematcs
More informationDetermining 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 informationA Clustering Algorithm Solution to the Collaborative Filtering
Internatonal Journal of Scence Vol.4 No.8 017 ISSN: 1813-4890 A Clusterng Algorthm Soluton to the Collaboratve Flterng Yongl Yang 1, a, Fe Xue, b, Yongquan Ca 1, c Zhenhu Nng 1, d,* Hafeng Lu 3, e 1 Faculty
More informationFeature-Based Matrix Factorization
Feature-Based Matrx Factorzaton arxv:1109.2271v3 [cs.ai] 29 Dec 2011 Tanq Chen, Zhao Zheng, Quxa Lu, Wenan Zhang, Yong Yu {tqchen,zhengzhao,luquxa,wnzhang,yyu}@apex.stu.edu.cn Apex Data & Knowledge Management
More informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationEvaluation of an Enhanced Scheme for High-level Nested Network Mobility
IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October 2015 1 Evaluaton of an Enhanced Scheme for Hgh-level Nested Network Moblty Mohammed Babker Al Mohammed, Asha Hassan.
More informationLobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide
Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.
More informationScheduling 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 informationA 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 informationAnalysis of Collaborative Distributed Admission Control in x Networks
1 Analyss of Collaboratve Dstrbuted Admsson Control n 82.11x Networks Thnh Nguyen, Member, IEEE, Ken Nguyen, Member, IEEE, Lnha He, Member, IEEE, Abstract Wth the recent surge of wreless home networks,
More informationBRDPHHC: A Balance RDF Data Partitioning Algorithm based on Hybrid Hierarchical Clustering
015 IEEE 17th Internatonal Conference on Hgh Performance Computng and Communcatons (HPCC), 015 IEEE 7th Internatonal Symposum on Cyberspace Safety and Securty (CSS), and 015 IEEE 1th Internatonal Conf
More informationHigh-Boost Mesh Filtering for 3-D Shape Enhancement
Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,
More informationAssessing 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 informationCan We Beat the Prefix Filtering? An Adaptive Framework for Similarity Join and Search
Can We Beat the Prefx Flterng? An Adaptve Framework for Smlarty Jon and Search Jannan Wang Guolang L Janhua Feng Department of Computer Scence and Technology, Tsnghua Natonal Laboratory for Informaton
More informationCost-efficient deployment of distributed software services
1/30 Cost-effcent deployment of dstrbuted software servces csorba@tem.ntnu.no 2/30 Short ntroducton & contents Cost-effcent deployment of dstrbuted software servces Cost functons Bo-nspred decentralzed
More informationConstructing 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 informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationAdaptive Energy and Location Aware Routing in Wireless Sensor Network
Adaptve Energy and Locaton Aware Routng n Wreless Sensor Network Hong Fu 1,1, Xaomng Wang 1, Yngshu L 1 Department of Computer Scence, Shaanx Normal Unversty, X an, Chna, 71006 fuhong433@gmal.com {wangxmsnnu@hotmal.cn}
More informationA Similarity Measure Method for Symbolization Time Series
Research Journal of Appled Scences, Engneerng and Technology 5(5): 1726-1730, 2013 ISSN: 2040-7459; e-issn: 2040-7467 Maxwell Scentfc Organzaton, 2013 Submtted: July 27, 2012 Accepted: September 03, 2012
More informationA Time-Bound Ticket-Based Mutual Authentication Scheme for Cloud Computing
Int. J. of Computers, Communcatons & Control, ISSN 1841-9836, E-ISSN 1841-9844 Vol. VI (2011), No. 2 (June), pp. 227-235 A Tme-Bound Tcket-Based Mutual Authentcaton Scheme for Cloud Computng Z. Hao, S.
More informationA Deflected Grid-based Algorithm for Clustering Analysis
A Deflected Grd-based Algorthm for Clusterng Analyss NANCY P. LIN, CHUNG-I CHANG, HAO-EN CHUEH, HUNG-JEN CHEN, WEI-HUA HAO Department of Computer Scence and Informaton Engneerng Tamkang Unversty 5 Yng-chuan
More informationBIN XIA et al: AN IMPROVED K-MEANS ALGORITHM BASED ON CLOUD PLATFORM FOR DATA MINING
An Improved K-means Algorthm based on Cloud Platform for Data Mnng Bn Xa *, Yan Lu 2. School of nformaton and management scence, Henan Agrcultural Unversty, Zhengzhou, Henan 450002, P.R. Chna 2. College
More informationPruning 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 informationMining User Similarity Using Spatial-temporal Intersection
www.ijcsi.org 215 Mnng User Smlarty Usng Spatal-temporal Intersecton Ymn Wang 1, Rumn Hu 1, Wenhua Huang 1 and Jun Chen 1 1 Natonal Engneerng Research Center for Multmeda Software, School of Computer,
More informationEmpirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap
Int. Journal of Math. Analyss, Vol. 8, 4, no. 5, 7-7 HIKARI Ltd, www.m-hkar.com http://dx.do.org/.988/jma.4.494 Emprcal Dstrbutons of Parameter Estmates n Bnary Logstc Regresson Usng Bootstrap Anwar Ftranto*
More informationEnhancement of Infrequent Purchased Product Recommendation Using Data Mining Techniques
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
More informationA Topology-aware Random Walk
A Topology-aware Random Walk Inkwan Yu, Rchard Newman Dept. of CISE, Unversty of Florda, Ganesvlle, Florda, USA Abstract When a graph can be decomposed nto clusters of well connected subgraphs, t s possble
More informationSubspace 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 informationResearch of Dynamic Access to Cloud Database Based on Improved Pheromone Algorithm
, pp.197-202 http://dx.do.org/10.14257/dta.2016.9.5.20 Research of Dynamc Access to Cloud Database Based on Improved Pheromone Algorthm Yongqang L 1 and Jn Pan 2 1 (Software Technology Vocatonal College,
More informationPrivate Information Retrieval (PIR)
2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stock-market
More informationOutline. Type of Machine Learning. Examples of Application. Unsupervised Learning
Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton
More informationAn IPv6-Oriented IDS Framework and Solutions of Two Problems
An IPv6-Orented IDS Framework and Solutons of Two Problems We LI, Zhy FANG, Peng XU and ayang SI,2 School of Computer Scence and Technology, Jln Unversty Changchun, 3002, P.R.Chna 2 Graduate Unversty of
More informationParallel Implementation of Classification Algorithms Based on Cloud Computing Environment
TELKOMNIKA, Vol.10, No.5, September 2012, pp. 1087~1092 e-issn: 2087-278X accredted by DGHE (DIKTI), Decree No: 51/Dkt/Kep/2010 1087 Parallel Implementaton of Classfcaton Algorthms Based on Cloud Computng
More informationRemote Sensing Image Retrieval Algorithm based on MapReduce and Characteristic Information
Remote Sensng Image Retreval Algorthm based on MapReduce and Characterstc Informaton Zhang Meng 1, 1 Computer School, Wuhan Unversty Hube, Wuhan430097 Informaton Center, Wuhan Unversty Hube, Wuhan430097
More informationAn Efficient Algorithm for PC Purchase Decision System
Proceedngs of the 6th WSAS Internatonal Conference on Instrumentaton, Measurement, Crcuts & s, Hangzhou, Chna, Aprl 15-17, 2007 216 An ffcent Algorthm for PC Purchase Decson Huay Chang Department of Informaton
More informationMusic Information Retrieval Schemes in Peer-to-Peer Environments
Journal of Computer Scence 1 (3): 369-375, 2005 ISSN 1549-3636 Scence Publcatons, 2005 Musc Informaton Retreval Schemes n Peer-to-Peer Envronments Chaokun Wang, Janzhong L and Shengfe Sh School of Computer
More informationLearning-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 informationAn 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 informationAnalysis of Continuous Beams in General
Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,
More informationSmoothing 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 informationAn Approach for Recommender System by Combining Collaborative Filtering with User Demographics and Items Genres
Volume 18 No.13, October 015 An Approach for Recommender System by Combnng Collaboratve Flterng wth User Demographcs and Items Genres Saurabh Kumar Twar Department of Informaton Technology Samrat Ashok
More informationSimulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010
Smulaton: Solvng Dynamc Models ABE 5646 Week Chapter 2, Sprng 200 Week Descrpton Readng Materal Mar 5- Mar 9 Evaluatng [Crop] Models Comparng a model wth data - Graphcal, errors - Measures of agreement
More informationMining Web Logs with PLSA Based Prediction Model to Improve Web Caching Performance
JOURAL OF COMPUTERS, VOL. 8, O. 5, MAY 2013 1351 Mnng Web Logs wth PLSA Based Predcton Model to Improve Web Cachng Performance Chub Huang Department of Automaton, USTC Key laboratory of network communcaton
More informationSteps 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 informationAssignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.
Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton
More informationSecurity Vulnerabilities of an Enhanced Remote User Authentication Scheme
Contemporary Engneerng Scences, Vol. 7, 2014, no. 26, 1475-1482 HIKARI Ltd, www.m-hkar.com http://dx.do.org/10.12988/ces.2014.49186 Securty Vulnerabltes of an Enhanced Remote User Authentcaton Scheme Hae-Soon
More informationThe Effect of Sparsity on Collaborative Filtering Metrics
The Effect of Sparsty on Collaboratve Flterng Metrcs Jesus Bobadlla & Francsco Serradlla Unversdad Poltecnca de Madrd Crta. De Valenca, Km 7, 8031 Madrd, Span jbob@eu.upm.es, fserra@eu.upm.es Abstract
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationAbstract. 1 Introduction
Challenges and Solutons for Synthess of Knowledge Regardng Collaboratve Flterng Algorthms Danel Lowd, Olver Godde, Matthew McLaughln, Shuzhen Nong, Yun Wang, and Jonathan L. Herlocker. School of Electrcal
More informationProblem 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 informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More informationDeep 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 informationSelective Flooding Based on Relevant Nearest-Neighbor using Query Feedback and Similarity across Unstructured Peer-to-Peer Networks
Journal of Computer Scence 5 (3):184-190, 009 ISSN 1549-3636 009 Scence Publcatons Selectve Floodng Based on Relevant Nearest-Neghbor usng Query Feedback and Smlarty across Unstructured Peer-to-Peer Networks
More informationA MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS
Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung
More informationTECHNIQUE 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 informationReal-time Fault-tolerant Scheduling Algorithm for Distributed Computing Systems
Real-tme Fault-tolerant Schedulng Algorthm for Dstrbuted Computng Systems Yun Lng, Y Ouyang College of Computer Scence and Informaton Engneerng Zheang Gongshang Unversty Postal code: 310018 P.R.CHINA {ylng,
More informationSupport 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 informationFINDING 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 informationApplication of VCG in Replica Placement Strategy of Cloud Storage
Internatonal Journal of Grd and Dstrbuted Computng, pp.27-40 http://dx.do.org/10.14257/jgdc.2016.9.4.03 Applcaton of VCG n Replca Placement Strategy of Cloud Storage Wang Hongxa Computer Department, Bejng
More informationOverview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION
Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup
More informationBoundary-Based Time Series Sorting
JOURNAL OF ELECTRONIC SCIENCE AND TECHNOLOGY OF CHINA, VOL. 6, NO. 3, SEPTEMBER 2008 323 Boundary-Based Tme Seres Sortng Jun-Ku L, Yuan-Zhen Wang, and Ha-Bo L Abstract In many applcatons, t s desrable
More informationThe Shortest Path of Touring Lines given in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He
More information