Titlebook: Web-Age Information Management; 17th International C Bin Cui,Nan Zhang,Dexi Liu Conference proceedings 2016 Springer International Publishi

BREED

書目名稱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

Morphine

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

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

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

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

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

COLIC

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.

抓住他投降