派博傳思國(guó)際中心

標(biāo)題: Titlebook: Databases Theory and Applications; 28th Australasian Da Zi Huang,Xiaokui Xiao,Xin Cao Conference proceedings 2017 Springer International Pu [打印本頁(yè)]

作者: 娛樂某人    時(shí)間: 2025-3-21 18:19
書目名稱Databases Theory and Applications影響因子(影響力)




書目名稱Databases Theory and Applications影響因子(影響力)學(xué)科排名




書目名稱Databases Theory and Applications網(wǎng)絡(luò)公開度




書目名稱Databases Theory and Applications網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Databases Theory and Applications被引頻次




書目名稱Databases Theory and Applications被引頻次學(xué)科排名




書目名稱Databases Theory and Applications年度引用




書目名稱Databases Theory and Applications年度引用學(xué)科排名




書目名稱Databases Theory and Applications讀者反饋




書目名稱Databases Theory and Applications讀者反饋學(xué)科排名





作者: 征服    時(shí)間: 2025-3-21 22:09
Naresh Polisetti,Nancy C. Joyceneighbour (NN), namely . and .. In this paper, we propose a new join query which is called . join query. Given two point datasets . and . of multidimensional objects, the . query retrieves for each point in . its all surrounding points in .. As a new spatial join query, we propose algorithms that ar
作者: 行乞    時(shí)間: 2025-3-22 04:22

作者: Collected    時(shí)間: 2025-3-22 08:12
Ashley M. Crane,Sanjoy K. Bhattacharyats. Differently than most existing works, we use the deviation from targeted pairwise correlation constraints as an objective to minimize in our problem. Moreover, we include users preferences as an objective in the form of maximizing similarity to users’ initial sub-intervals. The combination of th
作者: 樹木中    時(shí)間: 2025-3-22 12:47

作者: anarchist    時(shí)間: 2025-3-22 13:52

作者: anarchist    時(shí)間: 2025-3-22 21:03
https://doi.org/10.1007/978-3-030-10696-6 Previous work such as [., ., .] has been proposed to answer the search. Such work typically measures the distance between trajectories and queries by the distance between query points and GPS points of trajectories. Such measurement could be inaccurate because those GPS points generated by some sam
作者: 記憶    時(shí)間: 2025-3-22 22:33
https://doi.org/10.1007/978-3-030-10696-6 and retrieval. Data-independent approaches (e.g., Locality Sensitive Hashing) normally construct hash functions using random projections, which neglect intrinsic data properties. To compensate this drawback, learning-based approaches propose to explore local data structure and/or supervised informa
作者: 多樣    時(shí)間: 2025-3-23 02:58
https://doi.org/10.1007/978-3-319-52264-7eed, semantic label independence. Among the existing solutions, graph hashing makes a significant contribution as it could effectively preserve the neighbourhood data similarities into binary codes via spectral analysis. However, existing graph hashing methods separate graph construction and hashing
作者: Asperity    時(shí)間: 2025-3-23 05:43
Vallendarer Schriften der Pflegewissenschaftal place for spreading rumors. Although different types of information are available in a post on social media, traditional approaches in rumor detection leverage only the text of the post, which limits their accuracy in detection. In this paper, we propose a provenance-aware approach based on recur
作者: 畫布    時(shí)間: 2025-3-23 13:20
Andreas Albert,Ingo Bode,Sarina Parschick irrelevant and redundant features. The majority of feature selection methods, which have been developed in the last decades, can deal with only numerical or categorical features. An exception is the Recursive Feature Elimination under the clinical kernel function which is an embedded feature select
作者: projectile    時(shí)間: 2025-3-23 17:47
Verena Breitbach,Hermann Brandenburge to its massive size and dynamic nature. The most crucial part of EEG data analysis is to discover hidden knowledge from a large volume of data through pattern mining for efficient analysis. This study focuses on discovering representative patterns from each channel data to recover useful informati
作者: 群居男女    時(shí)間: 2025-3-23 21:45

作者: 影響    時(shí)間: 2025-3-23 23:21

作者: LAPSE    時(shí)間: 2025-3-24 04:16

作者: 強(qiáng)所    時(shí)間: 2025-3-24 08:29
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/263526.jpg
作者: Carcinoma    時(shí)間: 2025-3-24 14:11

作者: BROW    時(shí)間: 2025-3-24 17:44

作者: sleep-spindles    時(shí)間: 2025-3-24 21:08
978-3-319-68154-2Springer International Publishing AG 2017
作者: MARS    時(shí)間: 2025-3-25 02:14
The Flexible Group Spatial Keyword Query nearest neighbor with keywords query, which finds the data object that optimizes the aggregate cost function for the whole group . of size . query objects, (ii) the subgroup nearest neighbor with keywords query, which finds the optimal subgroup of query objects and the data object that optimizes th
作者: iodides    時(shí)間: 2025-3-25 04:34
Surrounding Join Query Processing in Spatial Databasesneighbour (NN), namely . and .. In this paper, we propose a new join query which is called . join query. Given two point datasets . and . of multidimensional objects, the . query retrieves for each point in . its all surrounding points in .. As a new spatial join query, we propose algorithms that ar
作者: 消滅    時(shí)間: 2025-3-25 09:53

作者: LARK    時(shí)間: 2025-3-25 11:55

作者: STEER    時(shí)間: 2025-3-25 17:36
A Multi-way Semi-stream Join for a Near-Real-Time Data Warehousea warehousing. The requirements for semi-stream joins are fast, accurate processing and the ability to function well with limited memory. Currently, semi-stream algorithms presented in the literature such as MeshJoin, Semi-Stream Index Join and CacheJoin can join only one foreign key in the stream d
作者: septicemia    時(shí)間: 2025-3-25 21:45

作者: helper-T-cells    時(shí)間: 2025-3-26 00:57
Searching k-Nearest Neighbor Trajectories on Road Networks Previous work such as [., ., .] has been proposed to answer the search. Such work typically measures the distance between trajectories and queries by the distance between query points and GPS points of trajectories. Such measurement could be inaccurate because those GPS points generated by some sam
作者: delta-waves    時(shí)間: 2025-3-26 07:06

作者: minaret    時(shí)間: 2025-3-26 08:36

作者: Hla461    時(shí)間: 2025-3-26 12:49
Provenance-Based Rumor Detectional place for spreading rumors. Although different types of information are available in a post on social media, traditional approaches in rumor detection leverage only the text of the post, which limits their accuracy in detection. In this paper, we propose a provenance-aware approach based on recur
作者: 繁忙    時(shí)間: 2025-3-26 20:32
An Embedded Feature Selection Framework for Hybrid Data irrelevant and redundant features. The majority of feature selection methods, which have been developed in the last decades, can deal with only numerical or categorical features. An exception is the Recursive Feature Elimination under the clinical kernel function which is an embedded feature select
作者: 侵害    時(shí)間: 2025-3-26 23:47

作者: Largess    時(shí)間: 2025-3-27 01:53

作者: aviator    時(shí)間: 2025-3-27 05:52

作者: WAG    時(shí)間: 2025-3-27 09:37

作者: FAWN    時(shí)間: 2025-3-27 14:06

作者: Blood-Clot    時(shí)間: 2025-3-27 19:59

作者: Limousine    時(shí)間: 2025-3-27 22:54

作者: 競(jìng)選運(yùn)動(dòng)    時(shí)間: 2025-3-28 03:47
Efficient Supervised Hashing via Exploring Local and Inner Data Structure similarity by leveraging pair-wise supervised knowledge. Besides, we integrate discrete constraint to significantly eliminate accumulated errors in learning reliable hash codes and hash functions. We devise an alternative algorithm to efficiently solve the optimization problem. Extensive experiment
作者: OMIT    時(shí)間: 2025-3-28 07:51
Learning Robust Graph Hashing for Efficient Similarity Searchn and hashing learning into a unified learning framework. The learning process ensures the optimal graph to be constructed for subsequent hashing learning, and simultaneously the hashing codes can well preserve similarities of data samples. An effective optimization method is devised to iteratively
作者: 暴發(fā)戶    時(shí)間: 2025-3-28 14:26
A New Data Mining Scheme for Analysis of Big Brain Signal Datas (e.g. mean, standard deviation) are computed from the extracted pattern. Then aggregating all of the features extracted from each of the patterns in a subject, a feature vector set is created that is fed into random forest (RF) and random tree (RT) classification model, individually for classifyin
作者: sorbitol    時(shí)間: 2025-3-28 16:14
Mining High-Dimensional CyTOF Data: Concurrent Gating, Outlier Removal, and Dimension Reductionkew distributions have emerged as a promising alternative to the traditional normal mixture modelling. However, these models are not well suited to high-dimensional settings..This paper describes a flexible statistical approach designed for performing, at the same time, unsupervised clustering, dime
作者: Reservation    時(shí)間: 2025-3-28 19:18

作者: 制定    時(shí)間: 2025-3-28 23:03
Bruno Zuberbuhler,Stephen Tuft,David Spokescan be easily generalized to join with any number of tables in the master data. We evaluated the performance of all three algorithms, and our results show that the semi-concurrent architecture performs best under the same scenario.
作者: 頭盔    時(shí)間: 2025-3-29 04:40
https://doi.org/10.1007/978-3-030-10696-6ression algorithm which divides the original time series into several components reflecting periodicity and randomness respectively, and then approximates each component accordingly to guarantee overall compression ratio and maximum error. We conduct extensive evaluation on a real world dataset, and
作者: Hyperplasia    時(shí)間: 2025-3-29 07:13
https://doi.org/10.1007/978-3-030-10696-6over, we propose to cluster line segments and merge redundant trajectory IDs for higher efficiency. Experimental results validate that the proposed method significantly outperforms existing approaches in terms of saving storage cost of data and the query performance.
作者: 猛烈責(zé)罵    時(shí)間: 2025-3-29 14:49

作者: 拉開這車床    時(shí)間: 2025-3-29 19:22
https://doi.org/10.1007/978-3-319-52264-7n and hashing learning into a unified learning framework. The learning process ensures the optimal graph to be constructed for subsequent hashing learning, and simultaneously the hashing codes can well preserve similarities of data samples. An effective optimization method is devised to iteratively
作者: 可卡    時(shí)間: 2025-3-29 21:52

作者: 向宇宙    時(shí)間: 2025-3-30 00:13

作者: 字形刻痕    時(shí)間: 2025-3-30 05:50
Conference proceedings 2017 2017. ..The 20 full papers presented together with 2 demo papers were carefully reviewed and selected from 32 submissions.?The mission of ADC is to share novel research solutions to problems of today’s information?society that fulfill the needs of heterogeneous applications and environments and to
作者: 該得    時(shí)間: 2025-3-30 11:25

作者: Extricate    時(shí)間: 2025-3-30 14:27
Provenance-Based Rumor Detectionrent neural network to combine the provenance information and the text of the post itself to improve the accuracy of rumor detection. Experimental results on a real-world dataset show that our technique is able to outperform state-of-the-art approaches in rumor detection.
作者: 相一致    時(shí)間: 2025-3-30 17:29
Conference proceedings 2017identify?new issues and directions for future research and development work. The topics of the presented papers are related to?all practical and theoretical aspects of advanced database theory and?applications, as well as case studies and implementation experiences..
作者: 出來    時(shí)間: 2025-3-30 22:01





歡迎光臨 派博傳思國(guó)際中心 (http://www.pjsxioz.cn/) Powered by Discuz! X3.5
乃东县| 六枝特区| 汨罗市| 铁力市| 策勒县| 浮山县| 手游| 诸暨市| 泸定县| 洛南县| 定州市| 东丰县| 崇阳县| 察雅县| 白银市| 桦南县| 女性| 湘潭县| 洛川县| 兴文县| 苍梧县| 慈利县| 宁陵县| 厦门市| 佳木斯市| 无极县| 涞水县| 若尔盖县| 凤冈县| 庐江县| 海安县| 托克托县| 肃北| 平果县| 永吉县| 叙永县| 寿阳县| 玉溪市| 威海市| 龙游县| 双流县|