標(biāo)題: Titlebook: Database Systems for Advanced Applications; DASFAA 2018 Internat Chengfei Liu,Lei Zou,Jianxin Li Conference proceedings 2018 Springer Inter [打印本頁(yè)] 作者: 日月等 時(shí)間: 2025-3-21 18:57
書(shū)目名稱Database Systems for Advanced Applications影響因子(影響力)
書(shū)目名稱Database Systems for Advanced Applications影響因子(影響力)學(xué)科排名
書(shū)目名稱Database Systems for Advanced Applications網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Database Systems for Advanced Applications網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Database Systems for Advanced Applications被引頻次
書(shū)目名稱Database Systems for Advanced Applications被引頻次學(xué)科排名
書(shū)目名稱Database Systems for Advanced Applications年度引用
書(shū)目名稱Database Systems for Advanced Applications年度引用學(xué)科排名
書(shū)目名稱Database Systems for Advanced Applications讀者反饋
書(shū)目名稱Database Systems for Advanced Applications讀者反饋學(xué)科排名
作者: Constituent 時(shí)間: 2025-3-22 00:12 作者: 籠子 時(shí)間: 2025-3-22 01:25
https://doi.org/10.1007/978-3-030-81896-8on brings new challenges including high scalability, coexistence of tautonymy and synonym, complex similarity metrics as well as the requirement of data quality evaluation based on entity resolution. Facing these challenges, we introduce our solutions briefly and discuss the possible future work for entity resolution in big data era.作者: GROG 時(shí)間: 2025-3-22 05:27 作者: 偽造者 時(shí)間: 2025-3-22 11:49 作者: 使尷尬 時(shí)間: 2025-3-22 14:00 作者: 使尷尬 時(shí)間: 2025-3-22 17:30 作者: 牢騷 時(shí)間: 2025-3-22 22:20
Andranik S. Tangian,Josef Gruber, it is significant and essential to infer point-of-interests (POI) categories from trajectory data for user modeling and user preferences mining in many location-based services (LBS). Recent researches focus more on recommendation and prediction of next POI, which are based on the check-in data. Ch作者: 柔軟 時(shí)間: 2025-3-23 02:01
Experiments with Preference Functionsed in some applications. In this paper, we proposed an approach based on ALO and differential mutation operator that called ALO-DM. In this method, differential mutation operator and greedy strategy enhance the diversity of the population. In addition, combining it with data mining algorithms can be作者: 山頂可休息 時(shí)間: 2025-3-23 07:41 作者: 放逐某人 時(shí)間: 2025-3-23 10:10
On the Extension of Utility Functionsstributed computing environment. In general data analytical/mining processes, individual data owners need to provide their original data to the third parties. In many cases, however, the original data contain sensitive information, and the data owners do not want to disclose their data in the origin作者: Panther 時(shí)間: 2025-3-23 17:41
Constructing Separable Objective Functionsine the validity time of a fact statement by leveraging unstructured and noisy data from the Web, while overcoming the limitations of existing natural language processing technologies designed for the same task. Given a fact and its temporal relevance text, the proposed solution first constructs a S作者: exigent 時(shí)間: 2025-3-23 19:52 作者: Memorial 時(shí)間: 2025-3-24 01:16 作者: 漫步 時(shí)間: 2025-3-24 05:41
https://doi.org/10.1007/978-3-030-81896-8ction (IDS). Traditional algorithms generally compile an equivalent automaton from the regex query, then run it on the text to find all matching results. However, they have to scale linearly with the size of the text. Recent algorithms utilize various filtering techniques to quickly jump to candidat作者: 我的巨大 時(shí)間: 2025-3-24 08:51
Constructing the New Consumer Society can take advantage of the extracted schema for query optimization, structure browsing, and so on. In this paper, we consider extracting schemas from large graphs by using .. Although reasonable schemas can be extracted by the utility function, the major problem of the utility function is its comput作者: 昏暗 時(shí)間: 2025-3-24 12:29 作者: Between 時(shí)間: 2025-3-24 16:21
Constructing the New Consumer Societyry computing. By exploring the historical achievements under these umbrellas we try to motivate the researchers, to define such a framework for Graph Based Distributed SPARQL Query Processing, which supports Full of SPARQL and also explains the principles for employing optimization. In this study we作者: 等待 時(shí)間: 2025-3-24 19:03
Early Modern Literature in History they are assigned to needs to be taken into consideration. This has been put into practice when the Ministry of Education and preparatory schools have assigned students in fields of studies based on their performance at secondary schools. However, they used only the students grade 10 Ethiopian Gene作者: 血統(tǒng) 時(shí)間: 2025-3-25 03:08
https://doi.org/10.1007/978-3-319-91455-8artificial intelligence; automata theory; computer networks; data management applications; data manageme作者: glamor 時(shí)間: 2025-3-25 03:18 作者: indices 時(shí)間: 2025-3-25 08:36
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/263397.jpg作者: 膽大 時(shí)間: 2025-3-25 11:49
https://doi.org/10.1007/978-3-662-55612-2 for databases. Extensive experiments are designed to conduct both performance testing and analyzing under different schemas. The experimental results show that a reasonable configuration can contribute a good database performance, which provides factual basis for optimizing highly concurrent applic作者: angina-pectoris 時(shí)間: 2025-3-25 18:12
Andranik S. Tangian,Josef GruberIs directly. In this paper, we propose a collaborative inferring framework to analyze the actually visited POI categories from users’ historical trajectory data. Through modeling relationships among the user, time and POI category, the tensor decomposition method can effectively complement the missi作者: SUE 時(shí)間: 2025-3-25 21:30 作者: 充滿人 時(shí)間: 2025-3-26 03:48 作者: Verify 時(shí)間: 2025-3-26 04:19 作者: Bombast 時(shí)間: 2025-3-26 09:17
Tensor Factorization Based POI Category InferenceIs directly. In this paper, we propose a collaborative inferring framework to analyze the actually visited POI categories from users’ historical trajectory data. Through modeling relationships among the user, time and POI category, the tensor decomposition method can effectively complement the missi作者: coalition 時(shí)間: 2025-3-26 15:56 作者: 門(mén)窗的側(cè)柱 時(shí)間: 2025-3-26 19:01
Developing Knowledge-Based Systems Using Data Mining Techniques for Advising Secondary School Studens preprocessed for missing values, outliers, noisy and errors. Then the model is experimented using decision tree (j48) and rule induction (PART) algorithms. In this study as compared to j48, the PART unpruned decision list algorithm has 98.003% predictive performance. Thus, the knowledge discovered作者: 旁觀者 時(shí)間: 2025-3-26 23:49
ALO-DM: A Smart Approach Based on Ant Lion Optimizer with Differential Mutation Operator in Big Datafferential mutation operator and greedy strategy enhance the diversity of the population. In addition, combining it with data mining algorithms can be useful and practical in big data analytics problems. The simulation results not only show that the ALO-DM is able to obtain accurate solution, but also demonstrate that it is feasible and effective.作者: Pageant 時(shí)間: 2025-3-27 03:36
Conference proceedings 2018ing workshops: the 5th International Workshop on Big Data Management and Service, BDMS 2018; the Third International Workshop on Big Data Quality Management, BDQM 2018; the Second International Workshop on Graph Data Management and Analysis, GDMA 2018; and the 5th International Workshop on Semantic Computing and Personalization, SeCoP 2018..作者: BOLT 時(shí)間: 2025-3-27 08:29 作者: GULF 時(shí)間: 2025-3-27 12:16 作者: caldron 時(shí)間: 2025-3-27 15:02 作者: 易達(dá)到 時(shí)間: 2025-3-27 21:44 作者: crumble 時(shí)間: 2025-3-28 00:25
Constructing Separable Objective Functionsrate their risk estimation into the process of probability computation. Our experiments on real data shows that the proposed approach can achieve considerable improvements in performance over 2 state-of-the-art alternatives, and the proposed risk reduction technique can effectively improve validity time reasoning’s precision.作者: 英寸 時(shí)間: 2025-3-28 05:29
Roles, Responsibilities and Boundary Ridinge propose a first variance-based approach for cleaning time series. In order to support the stream computation, we consider the data in a window as a whole and adopt the idea of sliding window to solve the problem in stream computation.作者: aptitude 時(shí)間: 2025-3-28 09:01 作者: JAMB 時(shí)間: 2025-3-28 13:58 作者: 箴言 時(shí)間: 2025-3-28 16:08
Enabling Temporal Reasoning for Fact Statements: A Web-Based Approachrate their risk estimation into the process of probability computation. Our experiments on real data shows that the proposed approach can achieve considerable improvements in performance over 2 state-of-the-art alternatives, and the proposed risk reduction technique can effectively improve validity time reasoning’s precision.作者: 炸壞 時(shí)間: 2025-3-28 19:03 作者: legacy 時(shí)間: 2025-3-28 23:08 作者: jettison 時(shí)間: 2025-3-29 06:18 作者: hypertension 時(shí)間: 2025-3-29 09:34
https://doi.org/10.1007/978-3-662-55612-2features through multi-type pooling. Experiments show that the CNN with multi-convolution and multi-type pooling (CNN-MCMP) obtains better performance on text classification compared with both the shallow machine-learning models and other CNN architectures.作者: 表主動(dòng) 時(shí)間: 2025-3-29 12:29
https://doi.org/10.1007/978-3-662-55612-2sed hash strategy to ensure both the partition balancing and less partitioning time. Especially, existing trajectory data are not required to be repartitioned when new data arrive. Extensive experiments on three real data sets demonstrated that the performance of the proposed technique outperformed other partitioning techniques.作者: 大猩猩 時(shí)間: 2025-3-29 19:30
Constructing Separable Objective Functionsser-based collaborative filtering algorithm (CFC), and validates the validity of the algorithm in the prototype of the proposed system. The experimental results show that the recommendation algorithms can significantly improve accuracy of the recommendation.作者: 侵略 時(shí)間: 2025-3-29 20:26 作者: exigent 時(shí)間: 2025-3-30 02:11
https://doi.org/10.1007/978-1-349-25337-1ted SPARQL engine (e.g. TriAD) in an adaptive way and evaluate FedQL on a real-world dataset. The experimental results show that FedQL is efficient and effective in processing RDF stream and relational data in a federal way.作者: intention 時(shí)間: 2025-3-30 04:49 作者: rectocele 時(shí)間: 2025-3-30 10:06
Time-Based Trajectory Data Partitioning for Efficient Range Querysed hash strategy to ensure both the partition balancing and less partitioning time. Especially, existing trajectory data are not required to be repartitioned when new data arrive. Extensive experiments on three real data sets demonstrated that the performance of the proposed technique outperformed other partitioning techniques.作者: 使人煩燥 時(shí)間: 2025-3-30 15:21 作者: left-ventricle 時(shí)間: 2025-3-30 18:05
Secure Computation of Pearson Correlation Coefficients for High-Quality Data Analyticsnts. For the secure Pearson correlation computation, we first propose an advanced solution by exploiting the secure scalar product. We then present an approximate solution by adopting the lower-dimensional transformation. We finally empirically show that the proposed solutions are practical methods in terms of execution time and data quality.作者: Pert敏捷 時(shí)間: 2025-3-30 23:51 作者: 宏偉 時(shí)間: 2025-3-31 01:25
Extracting Schemas from Large Graphs with Utility Function and Parallelizationation cost. In this paper, we propose a schema extraction algorithm based on (a) a novel utility function called local utility function and (b) parallelization. Experimental results show that our algorithm can extract schemas from graphs more efficiently without losing quality of schemas.作者: 后退 時(shí)間: 2025-3-31 07:41 作者: 并排上下 時(shí)間: 2025-3-31 12:53
Convolutional Neural Networks for Text Classification with Multi-size Convolution and Multi-type Pootakes too much time and energy to extract features of data, but only obtains poor performance. Recently, deep learning methods are widely used in text classification and result in good performance. In this paper, we propose a Convolutional Neural Network (CNN) with multi-size convolution and multi-t
