標(biāo)題: Titlebook: Web Information Systems Engineering – WISE 2015; 16th International C Jianyong Wang,Wojciech Cellary,Yanchun Zhang Conference proceedings 2 [打印本頁] 作者: Reticent 時(shí)間: 2025-3-21 17:17
書目名稱Web Information Systems Engineering – WISE 2015影響因子(影響力)
書目名稱Web Information Systems Engineering – WISE 2015影響因子(影響力)學(xué)科排名
書目名稱Web Information Systems Engineering – WISE 2015網(wǎng)絡(luò)公開度
書目名稱Web Information Systems Engineering – WISE 2015網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Web Information Systems Engineering – WISE 2015被引頻次
書目名稱Web Information Systems Engineering – WISE 2015被引頻次學(xué)科排名
書目名稱Web Information Systems Engineering – WISE 2015年度引用
書目名稱Web Information Systems Engineering – WISE 2015年度引用學(xué)科排名
書目名稱Web Information Systems Engineering – WISE 2015讀者反饋
書目名稱Web Information Systems Engineering – WISE 2015讀者反饋學(xué)科排名
作者: 免費(fèi) 時(shí)間: 2025-3-21 22:46 作者: 寵愛 時(shí)間: 2025-3-22 00:42 作者: AMOR 時(shí)間: 2025-3-22 07:24 作者: Tailor 時(shí)間: 2025-3-22 08:45 作者: 流動(dòng)才波動(dòng) 時(shí)間: 2025-3-22 13:30 作者: 記憶 時(shí)間: 2025-3-22 20:55 作者: Muscularis 時(shí)間: 2025-3-22 21:48 作者: 大喘氣 時(shí)間: 2025-3-23 03:47
0302-9743 e on Web Information SystemsEngineering, WISE 2015, held in Miami, FL, USA, in November 2015...The 53 full papers, 17 short and 14 special sessions andinvited papers, presented in these proceedings were carefully reviewed andselected from 189 submissions. The papers cover the areas of big datatechni作者: Concrete 時(shí)間: 2025-3-23 06:52 作者: fabricate 時(shí)間: 2025-3-23 12:45 作者: Aspiration 時(shí)間: 2025-3-23 17:30 作者: stressors 時(shí)間: 2025-3-23 19:31 作者: 說笑 時(shí)間: 2025-3-23 23:46
Conference proceedings 2015ing, Web-based applications,Web-based business processes and Web services, Web data integration andmashups, Web data models, Web information retrieval, Web privacy and security,Web-based recommendations, and Web search..作者: 我正派 時(shí)間: 2025-3-24 03:54 作者: 一再遛 時(shí)間: 2025-3-24 07:14 作者: glomeruli 時(shí)間: 2025-3-24 12:51
HV: A Feature Based Method for Trajectory Dataset Profiling,the representative trajectories by the global heuristic voting (HV) function based on the feature model. We evaluate our methods based on extensive experiments by using a real-world trajectory dataset generated by over 12,000 taxicabs in Beijing. The results demonstrate the efficiency and effectiveness of our methods in different applications.作者: gustation 時(shí)間: 2025-3-24 15:34 作者: Ornithologist 時(shí)間: 2025-3-24 21:52 作者: patella 時(shí)間: 2025-3-25 01:46 作者: N斯巴達(dá)人 時(shí)間: 2025-3-25 04:23 作者: 一加就噴出 時(shí)間: 2025-3-25 07:48
GraSS: An Efficient Method for RDF Subgraph Matching,m encoding a star subgraph into a bit string. A SPARQL query graph is decomposed into several star query subgraphs which can be efficiently processed benefiting from succinct FFD-index data structure. Extensive evaluation shows that our approach outperforms RDF-3X and gStore on solving subgraph matching.作者: emission 時(shí)間: 2025-3-25 15:12
A Dynamically Extensible Open Cross-Document Link Service,ns via gateways. The presented concepts and architecture for dynamic extensibility improve the document life cycle in so-called cross-media information spaces and enable future-proof cross-document linking.作者: 防水 時(shí)間: 2025-3-25 16:25
Time-Sensitive Topic Derivation in Twitter, clusters the tweets and identifies the representative terms for each topic. Our experimental results show that the inclusion of temporal features into topic derivation results in a significant improvement for both topic clustering accuracy and topic coherence comparing to existing baseline methods.作者: 怎樣才咆哮 時(shí)間: 2025-3-25 22:53 作者: 客觀 時(shí)間: 2025-3-26 01:19
GraSS: An Efficient Method for RDF Subgraph Matching,m encoding a star subgraph into a bit string. A SPARQL query graph is decomposed into several star query subgraphs which can be efficiently processed benefiting from succinct FFD-index data structure. Extensive evaluation shows that our approach outperforms RDF-3X and gStore on solving subgraph matching.作者: 獨(dú)行者 時(shí)間: 2025-3-26 07:54 作者: Prognosis 時(shí)間: 2025-3-26 09:04 作者: OMIT 時(shí)間: 2025-3-26 13:03 作者: 蟄伏 時(shí)間: 2025-3-26 20:12
Grouping Product Aspects from Short Texts Using Multiple Classifiers,iew websites. Because of the distinct vocabulary used by consumers to describe the same aspects of a product, it is necessary to group pros and cons to support consumers’ decision making. For this purpose we propose a supervised classification model, consisting of an ensemble classifier that combine作者: 難取悅 時(shí)間: 2025-3-27 00:15 作者: EXULT 時(shí)間: 2025-3-27 02:53
Temporally Enhanced Ontologies in OWL: A Shared Conceptual Model and Reference Implementation,logy authors choose to represent changes in time. We present a temporal conceptual model for OWL?DL ontologies that allows the expression of ., i.e., properties that change in time, that is both representation-agnostic and serializable for the various available representation schemes. We also provid作者: nerve-sparing 時(shí)間: 2025-3-27 05:54
HV: A Feature Based Method for Trajectory Dataset Profiling,lenges to the management and analysis of such a big data. In this paper, we focus on the trajectory dataset profiling problem, and aim to extract the representative trajectories from the raw trajectory as a subset, called profile, which can best describe the whole dataset. This problem is very chall作者: 散布 時(shí)間: 2025-3-27 10:23 作者: 適宜 時(shí)間: 2025-3-27 14:15 作者: 不安 時(shí)間: 2025-3-27 19:21 作者: faucet 時(shí)間: 2025-3-28 01:43 作者: triptans 時(shí)間: 2025-3-28 03:36 作者: 平息 時(shí)間: 2025-3-28 09:36
Temporally Enhanced Ontologies in OWL: A Shared Conceptual Model and Reference Implementation,logy authors choose to represent changes in time. We present a temporal conceptual model for OWL?DL ontologies that allows the expression of ., i.e., properties that change in time, that is both representation-agnostic and serializable for the various available representation schemes. We also provid作者: infringe 時(shí)間: 2025-3-28 12:31 作者: Engaged 時(shí)間: 2025-3-28 18:32
GraSS: An Efficient Method for RDF Subgraph Matching,or data and knowledge representation. Unlike queries on relational databases, most of queries applied on RDF data are known as ., expressed in the SPARQL language. Subgraph matching, a basic SPARQL operation, is known to be NP-complete. Coupled with the rapidly increasing volumes of RDF data, it mak作者: 非實(shí)體 時(shí)間: 2025-3-28 19:16
A Dynamically Extensible Open Cross-Document Link Service,, most existing document linking approaches show some shortcomings in terms of the offered link granularity and cannot easily be extended to support new document formats. More recently, we see new document formats such as the Office Open XML?(OOXML) standard which facilitate the linking to parts of 作者: 效果 時(shí)間: 2025-3-28 23:53 作者: MAPLE 時(shí)間: 2025-3-29 04:57 作者: Assemble 時(shí)間: 2025-3-29 10:49 作者: 旁觀者 時(shí)間: 2025-3-29 12:46
Ranked Reverse Boolean Spatial Keyword Nearest Neighbors Search,ely studied on the database research community. But the R.NN query cannot retrieve spatio-textual objects which are described by their spatial location and a set of keywords. Therefore, researchers proposed a RST.NN query to find these objects, taking both spatial and textual similarity into conside作者: Endometrium 時(shí)間: 2025-3-29 18:10
OSCAR: OpenStreetMap Planet at Your Fingertips via OSm Cell ARrangements, on all relevant tags of the OSM data is possible. At the core of our OSCAR system lies the construction of a so-called . induced by all regions defined in the raw data. By having our index structure based on this cell arrangement, we can efficiently (with respect to query time and space) incorporat作者: paragon 時(shí)間: 2025-3-29 21:19
GraSS: An Efficient Method for RDF Subgraph Matching,or data and knowledge representation. Unlike queries on relational databases, most of queries applied on RDF data are known as ., expressed in the SPARQL language. Subgraph matching, a basic SPARQL operation, is known to be NP-complete. Coupled with the rapidly increasing volumes of RDF data, it mak作者: Concrete 時(shí)間: 2025-3-30 00:00 作者: 虛構(gòu)的東西 時(shí)間: 2025-3-30 06:55
FreeS: A Fast Algorithm to Discover Frequent Free Subtrees Using a Novel Canonical Form, is presented to discover all frequently occurring free subtrees in a database of labelled free trees. . is designed using an optimal canonical form, BOCF that can uniquely represent free trees even during the presence of isomorphism. To avoid enumeration of false positive candidates, it utilises th作者: NATTY 時(shí)間: 2025-3-30 09:17 作者: Preserve 時(shí)間: 2025-3-30 16:03
Time-Sensitive Topic Derivation in Twitter,management, business advertisements and corporate/government communication. These activities have used mostly Twitter content to derive topics. More recently, tweet interactions have also been considered, leading to better topics. Given the dynamic aspect of Twitter, we hypothesize that temporal fea作者: Dysplasia 時(shí)間: 2025-3-30 18:53
Combining Syntactic and Semantic Evidence for Improving Matching over Linked Data Sources,tions. Such annotations can, in turn, underpin the inference of semantic correspondences between sources. This paper shows that using semantic annotations as additional evidence of equivalence between schematic representations of LD sources can improve upon the prevalent, purely syntactic approaches作者: Negotiate 時(shí)間: 2025-3-30 23:39 作者: Communal 時(shí)間: 2025-3-31 01:56
Creating Diverse Product Review Summaries: A Graph Approach,lume of such reviews can be overwhelming for a web user to comprehend the gist of overall information communicated by other consumers. In this paper, we address the problem of summarizing user contributed product reviews, having certain properties that differentiate them significantly from summarizi作者: GIDDY 時(shí)間: 2025-3-31 05:22 作者: 微塵 時(shí)間: 2025-3-31 11:10
Implicit Trust and Distrust Prediction for Recommender Systems,rks of TARSs suffer from the problem of the lack of explicit trust which may not always be available in online social networks. In order to solve this issue, some implicit trust based TARSs are proposed. However, these methods generally predict implicit trust scores between users based on the interp作者: 殘廢的火焰 時(shí)間: 2025-3-31 15:50
EPC Graph Information Service,of life (e.g. anti-counterfeit). GS1 EPCglobal, a de facto standard in RFID technology, develops EPC Information Service (EPCIS) in order to capture and share standardized events representing various aspects on tag-attached object. However, the current standard is detrimental to the connection of th作者: 固執(zhí)點(diǎn)好 時(shí)間: 2025-3-31 19:01 作者: engender 時(shí)間: 2025-4-1 00:11
Combining Syntactic and Semantic Evidence for Improving Matching over Linked Data Sources,tions. Such annotations can, in turn, underpin the inference of semantic correspondences between sources. This paper shows that using semantic annotations as additional evidence of equivalence between schematic representations of LD sources can improve upon the prevalent, purely syntactic approaches作者: Adulterate 時(shí)間: 2025-4-1 05:52 作者: Debrief 時(shí)間: 2025-4-1 09:23 作者: 基因組 時(shí)間: 2025-4-1 13:25
Improving Marketing Interactions by Mining Sequences,corded today, the marketer can do a better job of measuring the effectiveness of marketing efforts. With multi-channel marketing data, comes a new set of challenges; those of measuring the effect of individual channels, understanding synergistic effects, and finally leveraging the information stored作者: 來就得意 時(shí)間: 2025-4-1 17:42
EPC Graph Information Service,of life (e.g. anti-counterfeit). GS1 EPCglobal, a de facto standard in RFID technology, develops EPC Information Service (EPCIS) in order to capture and share standardized events representing various aspects on tag-attached object. However, the current standard is detrimental to the connection of th作者: Nostalgia 時(shí)間: 2025-4-1 21:36
A Mashup Architecture with Modeling and Simulation as a Service,eneous data and varied services. Here we show how to simplify the M&S application development by using mashup technologies. We introduce a novel architecture, the Mashup Architecture with Modeling and Simulation as a Service (MAMSaaS), in order to deploy varied mashup components (e.g. Modeling and S作者: Confess 時(shí)間: 2025-4-2 00:31
Temporal PageRank on Social Networks, in assessing the authority of nodes on social networks. In this paper, a novel Temporal PageRank (T-PR) algorithm is proposed for analyzing the authority of nodes. Three temporal factors are adopted to personalize PageRank, which favors the nodes that are more important to people. They are Built-up作者: Discrete 時(shí)間: 2025-4-2 06:13 作者: 做方舟 時(shí)間: 2025-4-2 08:27
Conference proceedings 2015SE 2015, held in Miami, FL, USA, in November 2015...The 53 full papers, 17 short and 14 special sessions andinvited papers, presented in these proceedings were carefully reviewed andselected from 189 submissions. The papers cover the areas of big datatechniques and applications, deep/hidden Web, int作者: 使害羞 時(shí)間: 2025-4-2 13:55
Jie Zhu,Wei Jiang,An Liu,Guanfeng Liu,Lei Zhao approach to Stochastic Filtering and Control Problems. As the writing progressed. several new points of view were developed and as a result the present work is more in the nature of a monograph on the subject than a distilled compendium of extant works. The subject of this volume is at the heart of作者: 郊外 時(shí)間: 2025-4-2 16:21 作者: Odyssey 時(shí)間: 2025-4-2 19:40
Wei Jiang,Jie Zhu,Jiajie Xu,Zhixu Li,Pengpeng Zhao,Lei Zhaoeters according to the classical theoretical specification of these models. In the sequel an approach which explicitly considers the stochastic nature of the estimated regression coefficients in order to test the Frisch hypothesis is applied. Hence, besides the uncertainty originated by the specific作者: Oafishness 時(shí)間: 2025-4-3 03:38 作者: Sinus-Node 時(shí)間: 2025-4-3 07:42
Ahmed A. O. Tayeh,Beat Signeric excitations to the original Duffingvan der Pol equation, i.e. . where, . and . are the bifurcation parameters, .. and .. are white noise processes with intensities .. and .., respectively. The existence of the extrema of the probability density function is presented for the stochastic system. The作者: Heretical 時(shí)間: 2025-4-3 08:21 作者: 無價(jià)值 時(shí)間: 2025-4-3 15:49
