派博傳思國際中心

標(biāo)題: Titlebook: Web-Age Information Management; 17th International C Bin Cui,Nan Zhang,Dexi Liu Conference proceedings 2016 Springer International Publishi [打印本頁]

作者: BREED 時間: 2025-3-21 19:38
書目名稱Web-Age Information Management影響因子(影響力)

書目名稱Web-Age Information Management影響因子(影響力)學(xué)科排名

書目名稱Web-Age Information Management網(wǎng)絡(luò)公開度

書目名稱Web-Age Information Management網(wǎng)絡(luò)公開度學(xué)科排名

書目名稱Web-Age Information Management被引頻次

書目名稱Web-Age Information Management被引頻次學(xué)科排名

書目名稱Web-Age Information Management年度引用

書目名稱Web-Age Information Management年度引用學(xué)科排名

書目名稱Web-Age Information Management讀者反饋

書目名稱Web-Age Information Management讀者反饋學(xué)科排名

作者: Inscrutable 時間: 2025-3-21 22:49

作者: Morphine 時間: 2025-3-22 00:49
A Hybrid Machine-Crowdsourcing Approach for Web Table Matching and Cleaningesults and machine-generated results. When resolving inconsistency between data and semantics, relative trust is taken into account to validate data or semantics via crowd. Our experimental results show the effectiveness of the proposed approach for matching and cleaning web tables using real-life datasets.

作者: MURKY 時間: 2025-3-22 06:22
A Hybrid Machine-Crowdsourcing Approach for Web Table Matching and Cleaningesults and machine-generated results. When resolving inconsistency between data and semantics, relative trust is taken into account to validate data or semantics via crowd. Our experimental results show the effectiveness of the proposed approach for matching and cleaning web tables using real-life datasets.

作者: inspiration 時間: 2025-3-22 12:08
An Update Method for Shortest Path Caching with Burst Paths Based on Sliding Windowsethods are based on sliding windows. Specially, the incremental update method quantifies burst paths and updates the cache incrementally. Comprehensive experiments show that our methods surpass current best algorithm SPC by more than 30?% in terms of hit ratio on real road network data with burst paths.

作者: Lobotomy 時間: 2025-3-22 15:31
An Update Method for Shortest Path Caching with Burst Paths Based on Sliding Windowsethods are based on sliding windows. Specially, the incremental update method quantifies burst paths and updates the cache incrementally. Comprehensive experiments show that our methods surpass current best algorithm SPC by more than 30?% in terms of hit ratio on real road network data with burst paths.

作者: travail 時間: 2025-3-22 20:20
0302-9743 national Conference on Web-Age Information Management, WAIM 2016, held in Nanchang, China, in June 2016.?.The 80 full research papers presented together with 8 demonstrations were carefully reviewed and selected from 266 submissions. The focus of the conference is on following topics: data mining, s

作者: Evacuate 時間: 2025-3-22 22:58

作者: COLIC 時間: 2025-3-23 04:53
Efficient Approximate Substring Matching in Compressed Stringorithm to merge all the occurrences of substring efficiently to narrow down the potential region and design novel filterings to reduce the scale of candidates. The experiments show that our algorithm achieves outstanding performance and an interesting time-space trade-off in approximate matching for compressed string.

作者: 抓住他投降 時間: 2025-3-23 06:49

作者: Hangar 時間: 2025-3-23 11:52
Preserving the ,-Reachability When Anonymizing Social Networks, and keep it unchanged during anonymization. We show that .-RPA can efficiently find such a subgraph and anonymize the releasing graph with low information loss. Extensive experiments on real datasets illustrate that anonymized social networks generated by our method can be used to answer .-reachable queries with high accuracy.

作者: Vital-Signs 時間: 2025-3-23 15:34
Preserving the ,-Reachability When Anonymizing Social Networks, and keep it unchanged during anonymization. We show that .-RPA can efficiently find such a subgraph and anonymize the releasing graph with low information loss. Extensive experiments on real datasets illustrate that anonymized social networks generated by our method can be used to answer .-reachable queries with high accuracy.

作者: Plaque 時間: 2025-3-23 20:06

作者: 蝕刻 時間: 2025-3-23 23:56
Personalized Location Anonymity - A Kernel Density Estimation Approache selected based on both the entropy of personal visit probability and the area of Cloaking Region (CR). We conduct extensive experiments on the real dataset to verify the performance of privacy protection degree, where the privacy properties are measured by the location information entropy and the area of CR.

作者: 冥想后 時間: 2025-3-24 02:23
Detecting Data-model-oriented Anomalies in Parallel Business Processallel-process model and the data model. Then, an anomaly detection method under the divide-and-conquer framework is proposed to ensure efficiency in detecting anomalies in business processes. Both theoretical analysis and experimental results prove this method to be highly efficient and effective in detecting data model oriented anomalies.

作者: Incorporate 時間: 2025-3-24 07:57
Detecting Data-model-oriented Anomalies in Parallel Business Processallel-process model and the data model. Then, an anomaly detection method under the divide-and-conquer framework is proposed to ensure efficiency in detecting anomalies in business processes. Both theoretical analysis and experimental results prove this method to be highly efficient and effective in detecting data model oriented anomalies.

作者: Presbycusis 時間: 2025-3-24 12:52
Learning User Credibility on Aspects from Review Textse aspect ratings are assigned by mining semantic polarity. Then, an iteration algorithm is designed for estimating credibilities by considering the consistency between individual ratings and overall ratings on aspects. Finally, experiments on the real dataset demonstrate that our method outperforms baseline systems.

作者: terazosin 時間: 2025-3-24 15:22
Learning User Credibility on Aspects from Review Textse aspect ratings are assigned by mining semantic polarity. Then, an iteration algorithm is designed for estimating credibilities by considering the consistency between individual ratings and overall ratings on aspects. Finally, experiments on the real dataset demonstrate that our method outperforms baseline systems.

作者: agglomerate 時間: 2025-3-24 22:15

作者: Herpetologist 時間: 2025-3-25 00:44

作者: 過去分詞 時間: 2025-3-25 04:08

作者: magenta 時間: 2025-3-25 08:03
Low Overhead Log Replication for Main Memory Database System, which enhances performance and decreases recovery time. We implemented and evaluated our approach in a main memory database system (Oceanbase), and found that our method can offer 1.3x higher throughput than traditional log replication with synchronization mechanism.

作者: 脖子 時間: 2025-3-25 13:13

作者: nettle 時間: 2025-3-25 19:22

作者: 不給啤 時間: 2025-3-25 22:48
Detecting Anomalous Ratings Using Matrix Factorization for Recommender Systemsrative filtering recommender systems are highly vulnerable to “shilling” attacks due to its openness. Although attack detection based on such attacks has been extensively researched during the past decade, the studies on these issues have not reached an end. They either extract extra features from u

作者: vasospasm 時間: 2025-3-26 00:08
Detecting Anomalous Ratings Using Matrix Factorization for Recommender Systemsrative filtering recommender systems are highly vulnerable to “shilling” attacks due to its openness. Although attack detection based on such attacks has been extensively researched during the past decade, the studies on these issues have not reached an end. They either extract extra features from u

作者: TEN 時間: 2025-3-26 05:20
A Novel Spatial Cloaking Scheme Using Hierarchical Hilbert Curve for Location-Based Servicess a great convience to users, the location privacy is vulnerable in many ways (e.g., untrusted LBS Server). To address privacy issues, we propose ., a novel Hierarchical Hilbert Curve Spatial Cloaking algorithm to effectively achieve .-anonymity for mobile users in LBS. Different from existing metho

作者: caldron 時間: 2025-3-26 08:30
A Novel Spatial Cloaking Scheme Using Hierarchical Hilbert Curve for Location-Based Servicess a great convience to users, the location privacy is vulnerable in many ways (e.g., untrusted LBS Server). To address privacy issues, we propose ., a novel Hierarchical Hilbert Curve Spatial Cloaking algorithm to effectively achieve .-anonymity for mobile users in LBS. Different from existing metho

作者: Adjourn 時間: 2025-3-26 13:27

作者: HPA533 時間: 2025-3-26 19:48
Efficient Privacy-Preserving Content-Based Image Retrieval in the Cloud more storage space than ordinary data. While bringing in much convenience, existing cloud storage solutions could seriously breach the privacy of users. Encryption before outsourcing images to the cloud helps to protect the privacy of the data, but it also brings challenges to perform image retriev

作者: 鍵琴 時間: 2025-3-26 21:06

作者: 煤渣 時間: 2025-3-27 03:58

作者: 值得 時間: 2025-3-27 08:19

作者: BOON 時間: 2025-3-27 11:37

作者: Ibd810 時間: 2025-3-27 14:58

作者: Breach 時間: 2025-3-27 18:48

作者: Incumbent 時間: 2025-3-27 22:02
Learning User Credibility on Aspects from Review Texts or preferences so that they make distinct reviews/ratings, however they can not be treated as spammers. To date, the existing previous spammer detection technology has limited usability. In this paper, we propose a method to calculate user credibility on multi-dimensions by considering users differ

作者: Hirsutism 時間: 2025-3-28 02:38

作者: Exclaim 時間: 2025-3-28 10:03
Detecting Anomaly in Traffic Flow from Road Similarity Analysisrajectories of taxi are recorded by GPS devices and are commonly studied for understanding traffic dynamics. This paper focuses on anomaly detection in traffic volume, especially the . caused by unexpected or transient incidents, such as traffic accidents, celebrations and disasters. It is important

作者: 龍卷風(fēng) 時間: 2025-3-28 14:11
Detecting Anomaly in Traffic Flow from Road Similarity Analysisrajectories of taxi are recorded by GPS devices and are commonly studied for understanding traffic dynamics. This paper focuses on anomaly detection in traffic volume, especially the . caused by unexpected or transient incidents, such as traffic accidents, celebrations and disasters. It is important

作者: 嚴峻考驗 時間: 2025-3-28 18:11
PACOKS: Progressive Ant-Colony-Optimization-Based Keyword Search over Relational Databasesal data as a graph, and then find the minimum Steiner tree containing all the keywords by traversing the graph. However, the existing work involves substantial costs even for those based on heuristic algorithms, as the minimum Steiner tree problem is proved to be an NP-hard problem. In order to redu

作者: 大笑 時間: 2025-3-28 19:24

作者: 獸皮 時間: 2025-3-29 01:19

作者: 阻塞 時間: 2025-3-29 03:30
Enhanced Query Classification with Millions of Fine-Grained Topics a big challenge in real-world applications due to the sparse, noisy and ambiguous nature of queries. In this paper, we present another important issue called “the pomegranate phenomenon”. This phenomenon is named for the gap between manually manageable small taxonomy and massive coherent topics in

作者: 讓你明白 時間: 2025-3-29 10:06

作者: exostosis 時間: 2025-3-29 11:23

作者: 弄污 時間: 2025-3-29 18:21

作者: lymphoma 時間: 2025-3-29 22:42
An Update Method for Shortest Path Caching with Burst Paths Based on Sliding Windowsand other fields. By far, few existing methods has considered burst paths, which are common in real life. For instance, queries of a certain path can sharply increase due to a promotion or vacations. Such burst queries usually last for a relatively short period, and their frequencies are too low to

作者: AMEND 時間: 2025-3-30 01:49
Low Overhead Log Replication for Main Memory Database Systemse Paxos protocol to replicate log in multiple database instance sites. Since the replicated logs need to contain some metadata such as committed log sequence number (LSN), this increases the overhead of storage and network. It has significantly negative impact on the throughput in the update intens

作者: OWL 時間: 2025-3-30 05:51

作者: prosperity 時間: 2025-3-30 12:03

作者: neuron 時間: 2025-3-30 12:39

作者: GRE 時間: 2025-3-30 17:51
Efficient Approximate Substring Matching in Compressed Stringocus on space efficiency. We focus on how to efficiently search similar strings in text without decompressing the whole text. We propose RS-search algorithm to merge all the occurrences of substring efficiently to narrow down the potential region and design novel filterings to reduce the scale of ca

作者: Neuralgia 時間: 2025-3-31 00:34

作者: inhumane 時間: 2025-3-31 03:14
Top-, Similarity Search for Query-By-Humming novel Top-. similarity search technique, which provides fast retrieval for Query-By-Humming. We propose a distance function . for multi-dimensional sequence matching as well as a subsequence matching method .. We show that the proposed method is highly applicable to music retrieval. In our paper, m

作者: geometrician 時間: 2025-3-31 06:58

作者: phase-2-enzyme 時間: 2025-3-31 10:41

作者: Hyperopia 時間: 2025-3-31 13:25

作者: Jejune 時間: 2025-3-31 20:36
Yifan Gao,Yuming Li,Yanhong Pan,Jiali Mao,Rong Zhang

作者: Crohns-disease 時間: 2025-3-31 22:05

作者: cortex 時間: 2025-4-1 03:19
Chunhua Li,Pengpeng Zhao,Victor S. Sheng,Zhixu Li,Guanfeng Liu,Jian Wu,Zhiming Cui

作者: compose 時間: 2025-4-1 07:50

作者: 步履蹣跚 時間: 2025-4-1 12:38
Xiaohua Li,Ning Wang,Kanggui Peng,Xiaochun Yang,Ge Yu

作者: 實現(xiàn) 時間: 2025-4-1 15:06

作者: 切割 時間: 2025-4-1 22:12
Cem Aksoy,Ananya Dass,Dimitri Theodoratos,Xiaoying Wu

作者: 個人長篇演說 時間: 2025-4-2 02:18
mpf- und Gasstr?mung jedoch bleibt das ganze Rad vom Energietr?ger bespült, so da? dort die nicht beaufschlagten Kan?le recht hohe Ventilationsverluste verursachen und Reibungsverluste an den Radw?nden entstehen. Partielle Beaufschlagung ist bei Dampf- bzw. Gasturbinen deshalb stets ein Notbehelf.

作者: 過多 時間: 2025-4-2 03:39
mpf- und Gasstr?mung jedoch bleibt das ganze Rad vom Energietr?ger bespült, so da? dort die nicht beaufschlagten Kan?le recht hohe Ventilationsverluste verursachen und Reibungsverluste an den Radw?nden entstehen. Partielle Beaufschlagung ist bei Dampf- bzw. Gasturbinen deshalb stets ein Notbehelf.

作者: nauseate 時間: 2025-4-2 07:20
mpf- und Gasstr?mung jedoch bleibt das ganze Rad vom Energietr?ger bespült, so da? dort die nicht beaufschlagten Kan?le recht hohe Ventilationsverluste verursachen und Reibungsverluste an den Radw?nden entstehen. Partielle Beaufschlagung ist bei Dampf- bzw. Gasturbinen deshalb stets ein Notbehelf.

作者: 范例 時間: 2025-4-2 14:59
Zhihai Yang,Zhongmin Cai,Xinyuan Chenner werden Berechnungsverfahren und Unterlagen für die Ermittlung der Hauptabmessungen angegeben. Es war dabei mein Bestreben, dem Verst?ndnis des Lesers da? die Ergebnisse, wo immer das m?glich war, aus bekann- dadurch entgegenzukommen, ten Grundtatsachen heraus hergeleitet werden. Ist doch die Besch?ftigung978-3-519-06317-9978-3-322-96735-0

作者: 痛打 時間: 2025-4-2 18:01
Ningning Cui,Xiaochun Yang,Bin Wang0aaaeaacaWGXbWaa0baaSqaaiaadEhaaeaacaGGQaaaaa% aaaaa!3F59! 作者: 娘娘腔 時間: 2025-4-2 21:46

作者: irreducible 時間: 2025-4-3 01:55

作者: Haphazard 時間: 2025-4-3 04:07

作者: phase-2-enzyme 時間: 2025-4-3 10:15
Dapeng Zhao,Jiansong Ma,Xiaoling Wang,Xiuxia Tianm Brennbetrieb schwierig und ungenau ist, ist das Verfahren der?inneren Str?mungsmessung“ wenig geeignet. Demgegenüber ist die zweite Methode bei Gasturbinenbrennkammern im allgemeinen genauer und unbeschr?nkt anwendbar, sofern die nachgeschaltete Turbine oder Schubdüse durch eine ?quivalente Stau?f

作者: 過時 時間: 2025-4-3 15:34
Dapeng Zhao,Jiansong Ma,Xiaoling Wang,Xiuxia Tianht hervor, da? die von der umstr?menden Luft auf die Flugzeughaut insgesamt ausgeübte Reibungskraft im Reiseflug nahezu 50% des Gesamtwiderstandes ausmacht, dementsprechend auch die halbe Antriebsleistung aufzehrt und damit letztlich auch den halben Kraftstoffverbrauch verursacht. Gemessene Verteilu

歡迎光臨派博傳思國際中心 (http://www.pjsxioz.cn/)

景洪市| 绥江县| 英吉沙县| 灵宝市| 绵阳市| 海门市| 辉县市| 武安市| 新巴尔虎左旗| 筠连县| 长泰县| 竹北市| 富顺县| 晋中市| 沙坪坝区| 凤庆县| 阿鲁科尔沁旗| 思茅市| 和硕县| 浦城县| 广南县| 綦江县| 庆阳市| 杭锦旗| 昌宁县| 湛江市| 洱源县| 元谋县| 永福县| 乐昌市| 通山县| 莱芜市| 菏泽市| 微山县| 徐州市| 东乡县| 含山县| 神农架林区| 九龙坡区| 常山县| 资源县|