標(biāo)題: Titlebook: Database Systems for Advanced Applications; 20th International C Matthias Renz,Cyrus Shahabi,Muhammad Aamir Cheema Conference proceedings 2 [打印本頁] 作者: OBESE 時間: 2025-3-21 17:12
書目名稱Database Systems for Advanced Applications影響因子(影響力)
書目名稱Database Systems for Advanced Applications影響因子(影響力)學(xué)科排名
書目名稱Database Systems for Advanced Applications網(wǎng)絡(luò)公開度
書目名稱Database Systems for Advanced Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Database Systems for Advanced Applications被引頻次
書目名稱Database Systems for Advanced Applications被引頻次學(xué)科排名
書目名稱Database Systems for Advanced Applications年度引用
書目名稱Database Systems for Advanced Applications年度引用學(xué)科排名
書目名稱Database Systems for Advanced Applications讀者反饋
書目名稱Database Systems for Advanced Applications讀者反饋學(xué)科排名
作者: Flustered 時間: 2025-3-21 20:51 作者: 不可接觸 時間: 2025-3-22 01:36 作者: Veneer 時間: 2025-3-22 07:26 作者: 思想 時間: 2025-3-22 12:33 作者: 包租車船 時間: 2025-3-22 14:27 作者: 包租車船 時間: 2025-3-22 19:52
Changes in Government Goods and the Tax CodeOT2LD has been evaluated on 15 real-world data sets. The experimental results have shown that our method outperforms some other existing methods including SMOTE, Borderline-SMOTE, ADASYN, and MWMOTE, in terms of G-mean and F-measure.作者: 幻影 時間: 2025-3-22 23:17 作者: 刻苦讀書 時間: 2025-3-23 04:11
A Synthetic Minority Oversampling Method Based on Local Densities in Low-Dimensional Space for ImbalOT2LD has been evaluated on 15 real-world data sets. The experimental results have shown that our method outperforms some other existing methods including SMOTE, Borderline-SMOTE, ADASYN, and MWMOTE, in terms of G-mean and F-measure.作者: 突變 時間: 2025-3-23 09:35
Tracing Errors in Probabilistic Databases Based on the Bayesian Networkdels, we then define a notion of blame for ranking candidate errors. Next, we provide an efficient method for computing the degree of blame for each candidate error based on the probabilistic inference upon the ABN. Experimental results show the effectiveness and efficiency of our method.作者: 詩集 時間: 2025-3-23 12:44 作者: Gum-Disease 時間: 2025-3-23 16:20 作者: 魅力 時間: 2025-3-23 19:58
Katarína Petrov?iková,Franti?ek Sudzinathe filtering power in the Map stage was optimized effectively to decrease the transmission cost. Comprehensive experimental results on both real-world and synthetic datasets showed that MUSK outperformed the baseline approach with speeds up to 6 times in the best case, which indicated good scalability over large datasets.作者: 異常 時間: 2025-3-23 22:19
Consumer Culture in Latin Americaength and trip aggregated cost. We prove the problem is NP-hard and we distinguish it from existing related problems. We also proposed a framework and two effective algorithms to efficiently solve the . query in real time and produce near optimal results when tested on real datasets.作者: chiropractor 時間: 2025-3-24 05:27
FP-CPNNQ: A Filter-Based Protocol for Continuous Probabilistic Nearest Neighbor Queryns. We propose an efficient probabilistic filter-based protocol for answering continuous nearest neighbor queries over uncertain sensor data. Experimental evaluation on real-world temperature sensing data and synthetic location data showed a significant reduction in the number of update messages.作者: 金桌活畫面 時間: 2025-3-24 09:41
Efficient Queries Evaluation on Block Independent Disjoint Probabilistic Databasesries on BID probabilistic databases. Finally, we present the experimental results to show that the proposed algorithm can find safe plans for more queries than the state-of-the-art and the safe plans generated by the proposed algorithm are efficient and scale well.作者: misanthrope 時間: 2025-3-24 13:11 作者: scrape 時間: 2025-3-24 16:44
Skyline Trips of Multiple POIs Categoriesength and trip aggregated cost. We prove the problem is NP-hard and we distinguish it from existing related problems. We also proposed a framework and two effective algorithms to efficiently solve the . query in real time and produce near optimal results when tested on real datasets.作者: FUSE 時間: 2025-3-24 19:30
Changes in Government Goods and the Tax Codefirstly decomposes a data set into equal-sized cells, on which it performs wavelet transform and data density analysis to find the coarse shape of a rare category, and refines the coarse shape via an M.NN based metric. Experimental results on both synthetic and real data sets verify the effectiveness and efficiency of our approach.作者: Bereavement 時間: 2025-3-24 23:36 作者: 陶瓷 時間: 2025-3-25 06:58
https://doi.org/10.1007/978-3-642-46587-1etection based on local density estimates is not only well retained but sometimes even improved, an effect that can be explained by relating our method to outlier detection ensembles. At the same time, the outlier detection process is accelerated by two orders of magnitude.作者: 線 時間: 2025-3-25 10:48
The Personality of Brand Loverss we observed by extensive experimentation. We also design an external memory algorithm to mine large-size data which cannot be accommodated in main memory. The external memory algorithm uses spatial dimension to partition the data into a set of chunks to minimize the number of false positives and h作者: 華而不實 時間: 2025-3-25 13:56
Suzanne M. Spencer-Wood,Scott D. Heberlingvantages of our approach via significant criteria such as separability, interpretability and effectiveness in classification task of large datasets with high dimension and complex distribution. Our obtained results are highly competitive with state-of-the-art approaches.作者: kyphoplasty 時間: 2025-3-25 19:22 作者: locus-ceruleus 時間: 2025-3-25 22:40
W. Stephen McBride,Kim A. McBrideho might just be lacking educational skills, and plainly unethical workers. We show how current quality control measures misjudge and subsequently discriminate against honest workers with lower skill levels. In contrast, our techniques use statistical models that computes the level of a worker’s ski作者: 外來 時間: 2025-3-26 03:03 作者: Lumbar-Stenosis 時間: 2025-3-26 06:15
Consumer Culture in Latin Americaate the range search, a novel index structure called IOC-Tree is proposed based on the inverted indexing and octree techniques to effectively explore the spatio, temporal and textual pruning techniques. Furthermore, this structure can also support the query with order-sensitive keywords. Comprehensi作者: rheumatism 時間: 2025-3-26 10:14 作者: 祝賀 時間: 2025-3-26 15:31 作者: HILAR 時間: 2025-3-26 19:22
Effective and Interpretable Document Classification Using Distinctly Labeled Dirichlet Process Mixtuvantages of our approach via significant criteria such as separability, interpretability and effectiveness in classification task of large datasets with high dimension and complex distribution. Our obtained results are highly competitive with state-of-the-art approaches.作者: Opponent 時間: 2025-3-27 00:41 作者: 遭受 時間: 2025-3-27 03:29
Retaining Rough Diamonds: Towards a Fairer Elimination of Low-Skilled Workersho might just be lacking educational skills, and plainly unethical workers. We show how current quality control measures misjudge and subsequently discriminate against honest workers with lower skill levels. In contrast, our techniques use statistical models that computes the level of a worker’s ski作者: 內(nèi)疚 時間: 2025-3-27 06:05
Keyword-Aware Dominant Route Search for Various User Preferencesre Dominant Routes (KDR) query, which returns all possible preferable routes, covering a set of keywords under a specified budget constraint. We devise a novel algorithm DR for efficiently finding the exact result of a KDR query and a heuristic algorithm FDR to approximately answer a KDR query. Expe作者: 鞠躬 時間: 2025-3-27 11:25
Spatial Keyword Range Search on Trajectoriesate the range search, a novel index structure called IOC-Tree is proposed based on the inverted indexing and octree techniques to effectively explore the spatio, temporal and textual pruning techniques. Furthermore, this structure can also support the query with order-sensitive keywords. Comprehensi作者: Biofeedback 時間: 2025-3-27 14:07
A Synthetic Minority Oversampling Method Based on Local Densities in Low-Dimensional Space for Imbalurse of dimensionality because they rely heavily on Euclidean distance. This paper proposed a new method, called Minority Oversampling Technique based on Local Densities in Low-Dimensional Space (or MOT2LD in short). MOT2LD first maps each training sample into a low-dimensional space, and makes clus作者: corpuscle 時間: 2025-3-27 18:18 作者: 我怕被刺穿 時間: 2025-3-27 22:49
Rare Category Exploration on Linear Time Complexitye a high time complexity and are applicable to rare categories with compact and spherical shapes rather than arbitrary shapes. In this paper, we present FREE an effective and efficient RCE solution to explore rare categories of arbitrary shapes on a linear time complexity w.r.t. data set size. FREE 作者: MIRE 時間: 2025-3-28 05:19
FP-CPNNQ: A Filter-Based Protocol for Continuous Probabilistic Nearest Neighbor Queryireless sensor networks. In such applications, a large number of sensor devices are deployed to collect useful information such as temperature readings and vehicle positions. However, these distributed sensors usually have limited computational and communication power and thus the amount of sensor q作者: EWER 時間: 2025-3-28 06:36 作者: Vasodilation 時間: 2025-3-28 13:22 作者: Kaleidoscope 時間: 2025-3-28 15:29
Tracing Errors in Probabilistic Databases Based on the Bayesian Networkerrors in traditional databases, but they fall short of guiding us to find errors in probabilistic databases, especially for databases with complex correlations among data. In this paper, we propose a method for tracing errors in probabilistic databases by adopting Bayesian network (BN) as the frame作者: LAP 時間: 2025-3-28 18:52
Mining Frequent Spatial-Textual Sequence Patternslocation-based services. One such kind of data is Spatial-Textual sequential data (Activity-Trajectory data), i.e. a sequence of locations visited by a user with each location having a set of activities performed by the user is a Spatial-Textual sequence. Mining such data for knowledge discovery is 作者: 命令變成大炮 時間: 2025-3-29 00:22 作者: 大都市 時間: 2025-3-29 03:28 作者: Flinch 時間: 2025-3-29 10:43 作者: GEON 時間: 2025-3-29 14:58
Skyline Trips of Multiple POIs Categoriesiven a road network with a set of Points of Interest (POIs) from different categories, a list of items the user is planning to purchase and a pricing function for items at each related POI; find the skyline trips in term of both trip length and trip aggregated cost. This query has important applicat作者: Ornithologist 時間: 2025-3-29 16:37
Keyword-Aware Dominant Route Search for Various User Preferencescify their requirements. Recently, a new kind of keyword-aware optimal route (KOR) query is proposed for finding an optimal route such that it covers a set of user-specified keywords, it satisfies a budget constraint (e.g., time), and the total popularity of the route is maximized. For example, a us作者: Regurgitation 時間: 2025-3-29 19:59 作者: 爵士樂 時間: 2025-3-30 02:50
TOF: A Throughput Oriented Framework for Spatial Queries Processing in Multi-core Environmentnal approaches to spatial query processing were focused on reduction of query latency. In real world, most LBS applications emphasize throughput rather than query latency. TOF is designed to achieve maximum throughput. Instead of resorting to complex indexes, TOF chooses to execute a batch queries a作者: Obituary 時間: 2025-3-30 05:00 作者: incite 時間: 2025-3-30 11:19 作者: Compatriot 時間: 2025-3-30 15:23
https://doi.org/10.1007/978-3-642-46587-1t scalable to large data sets, making multidimensional outlier detection for big data still an open challenge. Existing approximate neighbor search methods are designed to preserve distances as well as possible. In this article, we present a highly scalable approach to compute the nearest neighbors 作者: Entirety 時間: 2025-3-30 17:41 作者: Allure 時間: 2025-3-31 00:27
Mehmet Huseyin Bilgin,Hakan Danis,Ugur Canireless sensor networks. In such applications, a large number of sensor devices are deployed to collect useful information such as temperature readings and vehicle positions. However, these distributed sensors usually have limited computational and communication power and thus the amount of sensor q作者: 擦掉 時間: 2025-3-31 03:30
Hrvoje Per?evi?,Mirjana Hladika,Marina Mi?inlock independent disjoint (BID) probabilistic databases. This problem is fundamental to evaluate queries whose time complexity is PTIME. We first introduce two new probabilistic table models which are the correlated table and the correlated block table, and a hybrid project which executes a disjoint作者: moribund 時間: 2025-3-31 06:16
Katarína Petrov?iková,Franti?ek Sudzinafor new parallel algorithms for efficient query processing on large scale uncertain strings. In this paper, we proposed a MapReduce-based parallel algorithm, called MUSK, for answering top-. queries over large scale uncertain strings. We used the probabilistic .-grams to generate key-value pairs. To作者: 不吉祥的女人 時間: 2025-3-31 10:26
Ronald Voorn,Sabrina Hegner,Ad Pruynerrors in traditional databases, but they fall short of guiding us to find errors in probabilistic databases, especially for databases with complex correlations among data. In this paper, we propose a method for tracing errors in probabilistic databases by adopting Bayesian network (BN) as the frame
