標(biāo)題: Titlebook: Web Technologies and Applications; 13th Asia-Pacific We Xiaoyong Du,Wenfei Fan,Mohamed A. Sharaf Conference proceedings 2011 Springer Berli [打印本頁] 作者: cerebral-cortex 時間: 2025-3-21 18:20
書目名稱Web Technologies and Applications影響因子(影響力)
書目名稱Web Technologies and Applications影響因子(影響力)學(xué)科排名
書目名稱Web Technologies and Applications網(wǎng)絡(luò)公開度
書目名稱Web Technologies and Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Web Technologies and Applications被引頻次
書目名稱Web Technologies and Applications被引頻次學(xué)科排名
書目名稱Web Technologies and Applications年度引用
書目名稱Web Technologies and Applications年度引用學(xué)科排名
書目名稱Web Technologies and Applications讀者反饋
書目名稱Web Technologies and Applications讀者反饋學(xué)科排名
作者: Graduated 時間: 2025-3-21 23:03
Music Review Classification Enhanced by Semantic Informationic reviews, related semantic music information is also utilized. A heuristic SVM classification algorithm is proposed to build the classifiers. SEMEC makes use of the concept of . and the . to combine the results from different classifiers. Extensive experimental results show that SEMEC is effective and efficient.作者: Picks-Disease 時間: 2025-3-22 01:57 作者: V切開 時間: 2025-3-22 05:39
Cleaning Uncertain Streams for Query Improvemente efficiency (i.e. data volume). In this paper, we propose a framework for cleaning uncertain data for query effectiveness and efficiency, which processes high-volume streams in parallel, and append new cleaning rules & queries seamlessly. We implement a prototype for video surveillance application over the architecture.作者: 漂亮才會豪華 時間: 2025-3-22 09:15 作者: GUILT 時間: 2025-3-22 14:28 作者: CURL 時間: 2025-3-22 17:20 作者: 蒙太奇 時間: 2025-3-22 22:24 作者: LOPE 時間: 2025-3-23 03:59 作者: 賭博 時間: 2025-3-23 08:15
CkNN Query Processing over Moving Objects with Uncertain Speeds in Road Networksy of an object being a . of query . is shown to be equivalent to the probability of a special line segment being one of the .-nearest lines from ., which greatly simplifies the probability calculation.作者: ASTER 時間: 2025-3-23 12:58
Web User Profiling on Proxy Logs and Its Evaluation in Personalizationr 40GB click streams over a 4 month period. We evaluate clustering-based recommendation effectiveness to confirm the optimality of the framework. The results show high hit precision compared with existing methods.作者: AMOR 時間: 2025-3-23 14:48 作者: bioavailability 時間: 2025-3-23 20:08 作者: CREEK 時間: 2025-3-24 00:36 作者: Crumple 時間: 2025-3-24 05:04 作者: largesse 時間: 2025-3-24 09:31
Effective Hybrid Recommendation Combining Users-Searches Correlations Using Tensors latent relationships between such similar instances, consisting of users and searches. Non redundant rules from such associations of user-searches are then used for making recommendations to the users.作者: 赤字 時間: 2025-3-24 11:14
Maintaining Internal Consistency of Report for Real-Time OLAP with Layer-Based Viewan OLAP query from being changed through using lock mechanism, and avoid the confliction between read and write operations with the help of layer mechanism. Our approach can effectively deal with report consistency issue, while at the same time avoiding the query contention between read and write operations under real-time OLAP environment.作者: follicle 時間: 2025-3-24 16:51
Maintaining Internal Consistency of Report for Real-Time OLAP with Layer-Based Viewan OLAP query from being changed through using lock mechanism, and avoid the confliction between read and write operations with the help of layer mechanism. Our approach can effectively deal with report consistency issue, while at the same time avoiding the query contention between read and write operations under real-time OLAP environment.作者: ORE 時間: 2025-3-24 21:02
Role Discovery for Graph Clusteringew graph clustering method, named ., which uses three different kinds of roles, each of which represents a different kind of vertices that connect communities. Experimental results show that our method outperforms state-of-the-art methods of graph clustering.作者: Ophthalmoscope 時間: 2025-3-25 03:06 作者: 解開 時間: 2025-3-25 04:28 作者: 刺耳的聲音 時間: 2025-3-25 09:50 作者: REP 時間: 2025-3-25 15:20
Discrete Trajectory Prediction on Mobile Dataarity of user’s movements and find the suitable predictor to gain result. Our extensive experiments demonstrate that proposed techniques are more accurate than existing forecasting schemes and suggest the proper time interval when processing mobile data.作者: paleolithic 時間: 2025-3-25 16:21
Discrete Trajectory Prediction on Mobile Dataarity of user’s movements and find the suitable predictor to gain result. Our extensive experiments demonstrate that proposed techniques are more accurate than existing forecasting schemes and suggest the proper time interval when processing mobile data.作者: 責(zé)難 時間: 2025-3-25 20:19 作者: Contend 時間: 2025-3-26 01:37
Personalized Web Search with User Geographic and Temporal Preferencesg search results, different weights are set to different query classes to balance among content, geographic and temporal information associated with a query. The experiment evaluation results show the effectiveness of our approach and improvement of the search quality.作者: membrane 時間: 2025-3-26 06:31 作者: Ebct207 時間: 2025-3-26 09:45
Efficient Approximate Top-, Query Algorithm Using Cube Indexalled . - . top-k query. Then we introduce an efficient index structure, i.e. ., based on which, we propose our novel Cube Index Algorithm (CIA). We analyze the complexity of both constructing cube index and CIA algorithm. Moreover, extensive experiments show that CIA performs much better than the well-known approximate TA. algorithm [3].作者: Homocystinuria 時間: 2025-3-26 15:04 作者: 就職 時間: 2025-3-26 17:48 作者: 依法逮捕 時間: 2025-3-26 22:40
0302-9743 r a variety of topics such as classification and clustering; spatial and temporal databases; personalization and recommendation; data analysis and application; Web mining; Web search and information retrieval; complex and social networks; and secure and semantic Web.978-3-642-20290-2978-3-642-20291-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 粗語 時間: 2025-3-27 04:03
Information Networks Mining and Analysissing, and mining of information networks in multiple disciplines, including social network analysis, World-Wide Web, database systems, data mining, machine learning, and networked communication and information systems. Moreover, with a great demand of research in this direction, there is a need to u作者: 業(yè)余愛好者 時間: 2025-3-27 09:14
iMiner: From Passive Searching to Active Pushingey words as tags of users to study and differentiate the user interaction behaviors, the search engine is able to actively push related and useful information to users based on their previous actions instead of passively waiting for users’ queries. However the user searching behavior is affected by 作者: HUMP 時間: 2025-3-27 12:52
Information Networks Mining and Analysissing, and mining of information networks in multiple disciplines, including social network analysis, World-Wide Web, database systems, data mining, machine learning, and networked communication and information systems. Moreover, with a great demand of research in this direction, there is a need to u作者: 芭蕾舞女演員 時間: 2025-3-27 16:37
On the Querying for Places on the Mobile Webed from mobile devices, notably smartphones, that can be geo-positioned using GPS or technologies that exploit wireless communication networks. In addition, web content is being geo-tagged. This transformation calls for new, spatio-textual query functionality. The research community is hard at work 作者: Notify 時間: 2025-3-27 20:03
iMiner: From Passive Searching to Active Pushingey words as tags of users to study and differentiate the user interaction behaviors, the search engine is able to actively push related and useful information to users based on their previous actions instead of passively waiting for users’ queries. However the user searching behavior is affected by 作者: 推遲 時間: 2025-3-28 01:25 作者: 令人作嘔 時間: 2025-3-28 05:41
On the Querying for Places on the Mobile Webed from mobile devices, notably smartphones, that can be geo-positioned using GPS or technologies that exploit wireless communication networks. In addition, web content is being geo-tagged. This transformation calls for new, spatio-textual query functionality. The research community is hard at work 作者: 江湖郎中 時間: 2025-3-28 09:26
Role Discovery for Graph Clusteringty-based methods are developed in the past decades. These methods may be called non-overlapping because they assume that a vertex belongs to one community. On the other hand, overlapping methods such as CPM, which assume that a vertex may belong to more than one community, have been drawing attentio作者: nuclear-tests 時間: 2025-3-28 13:00
Music Review Classification Enhanced by Semantic Information classify music reviews into categories according to their semantic meanings. A solution called the SEMEC model is proposed. In SEMEC, besides the music reviews, related semantic music information is also utilized. A heuristic SVM classification algorithm is proposed to build the classifiers. SEMEC 作者: Organization 時間: 2025-3-28 15:22
Aggregate Distance Based Clustering Using Fibonacci Series-FIBCLUS global score is calculated for each instance using the novel idea of Fibonacci series. The use of Fibonacci numbers is able to separate the instances effectively and, in hence, the intra-cluster similarity is increased and the inter-cluster similarity is decreased during clustering. The proposed FI作者: Hemiparesis 時間: 2025-3-28 18:48
Role Discovery for Graph Clusteringty-based methods are developed in the past decades. These methods may be called non-overlapping because they assume that a vertex belongs to one community. On the other hand, overlapping methods such as CPM, which assume that a vertex may belong to more than one community, have been drawing attentio作者: stratum-corneum 時間: 2025-3-29 00:58 作者: 包租車船 時間: 2025-3-29 03:17
Aggregate Distance Based Clustering Using Fibonacci Series-FIBCLUS global score is calculated for each instance using the novel idea of Fibonacci series. The use of Fibonacci numbers is able to separate the instances effectively and, in hence, the intra-cluster similarity is increased and the inter-cluster similarity is decreased during clustering. The proposed FI作者: Feature 時間: 2025-3-29 08:15 作者: LAVA 時間: 2025-3-29 11:25
Top-, Probabilistic Closest Pairs Query in Uncertain Spatial Databasesof finding probabilistic .closest pairs between two uncertain spatial datasets, namely, . (Top.-PCP) query, which has popular usages in real applications. Specifically, given two uncertain datasets in which each spatial object is modeled by a set of sample points, a Top.-PCP query retrieves the pair作者: 可行 時間: 2025-3-29 18:46 作者: 刪減 時間: 2025-3-29 21:02 作者: APNEA 時間: 2025-3-30 00:02 作者: 抓住他投降 時間: 2025-3-30 06:39
Discrete Trajectory Prediction on Mobile Datat techniques only consider objects’ individual history or crowd movement alone. In practice, either individual history or crowd movement is not enough to predict trajectory with high accuracy. In this paper, we focus on how to predict fragmental trajectory. Based on the discrete trajectory obtained 作者: 象形文字 時間: 2025-3-30 10:08
Cleaning Uncertain Streams for Query Improvement, application context covers specific cleaning rules to bring data close to the reality (i.e. data quality), and query features can filter data for the efficiency (i.e. data volume). In this paper, we propose a framework for cleaning uncertain data for query effectiveness and efficiency, which proce作者: 先兆 時間: 2025-3-30 16:02 作者: anarchist 時間: 2025-3-30 20:24
Personalized Web Search with User Geographic and Temporal Preferencesation needs. We propose a novel approach to capture user’s geographic and temporal preferences in the form of . and . by mining search results and user click-through data leveraging knowledge bases. Our approach classifies queries into five classes based on decision tree algorithm. When personalizin作者: etidronate 時間: 2025-3-31 00:33
Cleaning Uncertain Streams for Query Improvement, application context covers specific cleaning rules to bring data close to the reality (i.e. data quality), and query features can filter data for the efficiency (i.e. data volume). In this paper, we propose a framework for cleaning uncertain data for query effectiveness and efficiency, which proce作者: 不可知論 時間: 2025-3-31 02:25
Web User Profiling on Proxy Logs and Its Evaluation in Personalization words represent users and their actions. The main technical challenge addressed here is how to symbolize web access actions, by words, that are monitored through a web proxy. We develop a hierarchical URL dictionary generated from Yahoo! Directory and a cross-hierarchical matching method that provi作者: 侵害 時間: 2025-3-31 07:31 作者: 刻苦讀書 時間: 2025-3-31 11:48 作者: 褪色 時間: 2025-3-31 14:14 作者: Atrium 時間: 2025-3-31 19:33
Exploring Folksonomy and Cooking Procedures to Boost Cooking Recipe Recommendationtrieval despite the explosive data growth. Similar to other popular domains such as the movie-, music-, and book- recommendations, cooking recipe selection is also a daily activity in which user experiences can be greatly improved by adopting appropriate recommendation strategies. Based on content-b作者: 減弱不好 時間: 2025-3-31 22:25
Effective Hybrid Recommendation Combining Users-Searches Correlations Using Tensorsmensional models to find inter relationships between alike users and products. This paper proposes a novel recommendation method using the multi-dimensional model, tensor, to group similar users based on common search behaviour, and then finding associations within such groups for making effective i作者: 有法律效應(yīng) 時間: 2025-4-1 03:30 作者: 急急忙忙 時間: 2025-4-1 08:03 作者: dandruff 時間: 2025-4-1 13:45 作者: 瘋狂 時間: 2025-4-1 16:17
Efficient Approximate Top-, Query Algorithm Using Cube Indexs is inherent and unavoidable due to the user’s subjective judgment, and the cost of processing exact top-k queries is highly expensive for datasets with huge volume, it is intriguing to answer approximate top-k query instead. In this paper, we first define a novel kind of approximate top-k query, c作者: 敏捷 時間: 2025-4-1 20:51 作者: 一個攪動不安 時間: 2025-4-2 02:25 作者: Neolithic 時間: 2025-4-2 04:56
DVD: A Model for Event Diversified Versions Discoverynto events which are constructed online automatically and updated temporally. There are always diversified versions to describe an event and users usually are eager to know all the versions. With the huge quantity of documents, it is almost impossible for users to read all of them. In this paper, we作者: maladorit 時間: 2025-4-2 07:17 作者: Haphazard 時間: 2025-4-2 14:17 作者: MAIM 時間: 2025-4-2 18:19 作者: SEEK 時間: 2025-4-2 23:22
xplanation on which it relies, which are also rejected. It is not necessary to accept the more extreme claims about preservation of reference throughout scientific change in order to rebut antirealism, and Putnam’s thesis of the preservation of the extension of “water”, the idea that Dalton’s atoms 作者: 抵消 時間: 2025-4-3 01:51 作者: 航海太平洋 時間: 2025-4-3 04:43 作者: hallow 時間: 2025-4-3 08:45 作者: menopause 時間: 2025-4-3 14:03
Philip S. Yuein den ?von au?en“ mitgebrachten Schülerdispositionen zuzuschreiben, kommt der schulische Normalbetrieb wieder in den Blick (vgl. zum überblick z.B. Melzer/Schubarth/Tillmann 1995, Schubarth 1995, Lamnek 1995). Au?erdem verweisen zum Beispiel Teilauswertungen unserer Schulleiterbefragung auch auf i
