標題: Titlebook: Advances in Web Mining and Web Usage Analysis; 8th International Wo Olfa Nasraoui,Myra Spiliopoulou,Brij Masand Conference proceedings 2007 [打印本頁] 作者: Flange 時間: 2025-3-21 17:36
書目名稱Advances in Web Mining and Web Usage Analysis影響因子(影響力)
書目名稱Advances in Web Mining and Web Usage Analysis影響因子(影響力)學(xué)科排名
書目名稱Advances in Web Mining and Web Usage Analysis網(wǎng)絡(luò)公開度
書目名稱Advances in Web Mining and Web Usage Analysis網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Advances in Web Mining and Web Usage Analysis被引頻次
書目名稱Advances in Web Mining and Web Usage Analysis被引頻次學(xué)科排名
書目名稱Advances in Web Mining and Web Usage Analysis年度引用
書目名稱Advances in Web Mining and Web Usage Analysis年度引用學(xué)科排名
書目名稱Advances in Web Mining and Web Usage Analysis讀者反饋
書目名稱Advances in Web Mining and Web Usage Analysis讀者反饋學(xué)科排名
作者: Glossy 時間: 2025-3-21 22:20
Incorporating Usage Information into Average-Clicks Algorithm,ser’s intuition of distance better than the traditional measure of clicks between two pages. Average-Clicks however assumes that the probability of the user following any link on a web page is the same and gives equal weights to each of the out-going links. In our method “Usage Aware Average-Clicks”作者: 破譯密碼 時間: 2025-3-22 03:32
Nearest-Biclusters Collaborative Filtering with Constant Values,hbor CF is based either on common user or item similarities, to form the user’s neighborhood. The effectiveness of the aforementioned approaches would be augmented, if we could combine them. In this paper, we use biclustering to disclose this duality between users and items, by grouping them in both作者: 雜役 時間: 2025-3-22 05:46 作者: myriad 時間: 2025-3-22 09:35 作者: Gesture 時間: 2025-3-22 16:28
How to Define Searching Sessions on Web Search Engines, searchers. We compare three methods for defining sessions using: 1) Internet Protocol address and cookie; 2) Internet Protocol address, cookie, and a temporal limit on intra-session interactions; and 3) Internet Protocol address, cookie, and query reformulation patterns. Research results shows that作者: GRIEF 時間: 2025-3-22 20:10
Incorporating Concept Hierarchies into Usage Mining Based Recommendations,vided by a recommendation system. Resources like Google Directory, Yahoo! Directory and web-content management systems attempt to organize content conceptually. Most recommendation models are limited in their ability to use this domain knowledge. We propose a novel technique to incorporate the conce作者: 易受刺激 時間: 2025-3-23 00:23
A Random-Walk Based Scoring Algorithm Applied to Recommender Engines,lized product suggestions by extracting knowledge from the previous users’ interactions. In this paper, we present “ItemRank”, a random–walk based scoring algorithm, which can be used to rank products according to expected user preferences, in order to recommend top–rank items to potentially interes作者: INCUR 時間: 2025-3-23 02:10
Towards a Scalable ,NN CF Algorithm: Exploring Effective Applications of Clustering,sers benefit as they are able to find items of interest from an unmanageable number of available items. On the other hand, e-commerce sites that employ recommender systems can increase sales revenue in at least two ways: a) by drawing customers’ attention to items that they are likely to buy, and b)作者: relieve 時間: 2025-3-23 07:08 作者: Rct393 時間: 2025-3-23 09:41
Predicting the Political Sentiment of Web Log Posts Using Supervised Machine Learning Techniques Coe political sentiment of web log posts will help bloggers categorize and filter this exploding information source. In this paper we illustrate the effectiveness of supervised learning for sentiment classification on web log posts. We show that a Na?ve Bayes classifier coupled with a forward feature 作者: Brocas-Area 時間: 2025-3-23 14:56 作者: 一瞥 時間: 2025-3-23 20:03 作者: 母豬 時間: 2025-3-23 22:46 作者: Bouquet 時間: 2025-3-24 06:06
0302-9743 the Web, WEBKDD 2006. The WEBKDD workshop series has taken place as part of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) since 1999. The discipline of data mining delivers methodologies and tools for the an- ysis of large data volumes and the extraction of co作者: Devastate 時間: 2025-3-24 06:48 作者: 土產(chǎn) 時間: 2025-3-24 13:53
https://doi.org/10.1007/978-3-030-81896-8ations on two real data sets is provided, which show that the proposed method improves the performance of the CF process substantially. We attain more than 30% and 10% improvement in terms of precision and recall, respectively.作者: 進取心 時間: 2025-3-24 16:49 作者: DEFT 時間: 2025-3-24 19:23 作者: Arthr- 時間: 2025-3-25 01:59 作者: enflame 時間: 2025-3-25 04:39 作者: 機密 時間: 2025-3-25 08:11
Nearest-Biclusters Collaborative Filtering with Constant Values,ations on two real data sets is provided, which show that the proposed method improves the performance of the CF process substantially. We attain more than 30% and 10% improvement in terms of precision and recall, respectively.作者: WITH 時間: 2025-3-25 12:14 作者: 香料 時間: 2025-3-25 17:28 作者: Limpid 時間: 2025-3-25 21:23
Incorporating Concept Hierarchies into Usage Mining Based Recommendations,it seamlessly with other quantities used in similarity calculation like browsing order and time spent on a page. Additionally they demonstrate a simple, extensible system for assimilating more domain knowledge. We provide experimental results to illustrate the benefits of using concept hierarchy.作者: deficiency 時間: 2025-3-26 03:01 作者: myalgia 時間: 2025-3-26 05:56
Detecting Profile Injection Attacks in Collaborative Filtering: A Classification-Based Approach,gain associated with these attributes across the dimensions of attack type and profile size. We then evaluate their combined effectiveness at improving the robustness of user based recommender systems.作者: 起草 時間: 2025-3-26 09:16 作者: HUMP 時間: 2025-3-26 13:52 作者: 要求比…更好 時間: 2025-3-26 19:16
Fast Categorization of Web Documents Represented by Graphs,tation directly. In this chapter, three new, hybrid approaches to web document categorization are presented, built upon both graph and vector space representations, thus preserving the benefits and overcoming the limitations of each. The hybrid methods presented here are compared to vector-based mod作者: Resign 時間: 2025-3-27 00:23
A Random-Walk Based Scoring Algorithm Applied to Recommender Engines,compared to and, at the same time, it is less complex with respect to memory usage and computational cost too. The presentation of the method is accompanied by an analysis of the MovieLens data set main properties.作者: Aphorism 時間: 2025-3-27 03:14
Towards a Scalable ,NN CF Algorithm: Exploring Effective Applications of Clustering,st compresses data tremendously by building a straightforward but efficient clustering model. Recommendations are then generated quickly by using a simple .-based approach. We demonstrate the feasibility of . both analytically and empirically. We also show, by comparing with a number of other popula作者: myelography 時間: 2025-3-27 09:16 作者: 壓倒性勝利 時間: 2025-3-27 11:59
Understanding Content Reuse on the Web: Static and Dynamic Analyses,ome of the old content is used to compose new pages. If a page in a newer snapshot has content of a page in an older snapshot, we say that the source is a parent of the new page. We state the hypothesis that people use search engines to find pages and republish their content as a new document. We pr作者: 小口啜飲 時間: 2025-3-27 13:51 作者: 我不怕犧牲 時間: 2025-3-27 21:26
Public Administration and the Reform Agendal offline training, which make them unable to adapt when access patterns change between training sessions. We present improved online algorithms for shortcut link selection that are based on a novel analogy drawn between shortcutting and caching. In the same way that cache algorithms predict which m作者: BLUSH 時間: 2025-3-28 01:45 作者: 調(diào)情 時間: 2025-3-28 02:16
https://doi.org/10.1007/978-3-030-81896-8tation directly. In this chapter, three new, hybrid approaches to web document categorization are presented, built upon both graph and vector space representations, thus preserving the benefits and overcoming the limitations of each. The hybrid methods presented here are compared to vector-based mod作者: bourgeois 時間: 2025-3-28 08:12
,Two-Body Problem and?the?Solar System,compared to and, at the same time, it is less complex with respect to memory usage and computational cost too. The presentation of the method is accompanied by an analysis of the MovieLens data set main properties.作者: 閃光你我 時間: 2025-3-28 12:08 作者: Clinch 時間: 2025-3-28 15:27 作者: dainty 時間: 2025-3-28 22:10 作者: nurture 時間: 2025-3-29 02:01
Conference proceedings 2007n and business has led to new challenges and to intensive, dedicated research.Many ofthe infancy problems in Web mining have been solvedby now, but the tremendous potential for new and improved uses, as well as misuses, of the Web are leading to new challenges. ThethemeoftheWebKDD2006workshopwas“Kno作者: 補角 時間: 2025-3-29 05:03
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/150173.jpg作者: 偽善 時間: 2025-3-29 09:26 作者: receptors 時間: 2025-3-29 12:44
978-3-540-77484-6Springer-Verlag Berlin Heidelberg 2007作者: Magnificent 時間: 2025-3-29 16:02
Public Administration and the Reform Agendaage loaded satisfies the visitor’s needs and no additional navigation is necessary. In other cases, however, the visitor is better served by content located elsewhere on the site found by navigating links. If the path between a user’s current location and his eventual goal is circuitous, then the us作者: 樸素 時間: 2025-3-29 20:47 作者: Harpoon 時間: 2025-3-30 02:59
https://doi.org/10.1007/978-3-030-81896-8hbor CF is based either on common user or item similarities, to form the user’s neighborhood. The effectiveness of the aforementioned approaches would be augmented, if we could combine them. In this paper, we use biclustering to disclose this duality between users and items, by grouping them in both作者: 睨視 時間: 2025-3-30 06:39
https://doi.org/10.1007/978-3-030-81896-8model is that it can be used by both instance-based and model-based classifiers for categorization. However, this popular method of document representation does not capture important structural information, such as the order and proximity of word occurrence or the location of a word within the docum作者: Incumbent 時間: 2025-3-30 08:59
Public Administration and the Reform Agenda. This is because contents of the individual nodes in a hierarchy are related to the contents of their neighbors, ancestors, and descendants in the structure. In this paper, we show that significant improvements in precision can be obtained by leveraging knowledge about the structure of hierarchical作者: 傳染 時間: 2025-3-30 14:52
Comment: the EU and European identity, searchers. We compare three methods for defining sessions using: 1) Internet Protocol address and cookie; 2) Internet Protocol address, cookie, and a temporal limit on intra-session interactions; and 3) Internet Protocol address, cookie, and query reformulation patterns. Research results shows that
