標(biāo)題: Titlebook: Data Science; Third International Beiji Zou,Qilong Han,Zeguang Lu Conference proceedings 2017 Springer Nature Singapore Pte Ltd. 2017 Data [打印本頁] 作者: Corrugate 時(shí)間: 2025-3-21 17:19
書目名稱Data Science影響因子(影響力)
書目名稱Data Science影響因子(影響力)學(xué)科排名
書目名稱Data Science網(wǎng)絡(luò)公開度
書目名稱Data Science網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Data Science被引頻次
書目名稱Data Science被引頻次學(xué)科排名
書目名稱Data Science年度引用
書目名稱Data Science年度引用學(xué)科排名
書目名稱Data Science讀者反饋
書目名稱Data Science讀者反饋學(xué)科排名
作者: Intentional 時(shí)間: 2025-3-21 21:51 作者: 一個(gè)攪動(dòng)不安 時(shí)間: 2025-3-22 02:55 作者: 保留 時(shí)間: 2025-3-22 06:27
https://doi.org/10.1057/9780230234239motion. Subjective tests show that the average emotional mean opinion score is 4.14 for Tibetan and 4.26 for Mandarin. The average mean opinion score is 4.16 for Tibetan and 4.28 for Mandarin. The average degradation opinion score is 4.28 for Tibetan and 4.24 for Mandarin. Therefore, the proposed me作者: Irrepressible 時(shí)間: 2025-3-22 11:14
Chile: A Pioneer in Trade Policyuence maximization named as BS-G (BSIS with Greedy Algorithm) to select the initial node. In the experiments, we use two real social network data sets on the Hadoop and Spark distributed cluster platform for experiments, and the experiment results show that BSIS model and BS-G algorithm on big data 作者: AWE 時(shí)間: 2025-3-22 16:53
Michael D. Bradley,Jeff Colvin,Mary Perkinspose a distributed data scheduling algorithm to solve the multi-objective problem in polynomial time. Through simulations, we show the proposed algorithm outperforms other conventional algorithms in perceived video quality and utilization of peers’ upload capacity.作者: AWE 時(shí)間: 2025-3-22 20:18
https://doi.org/10.1007/978-1-4615-4044-1ulations in two models, which are wireless sensor network (WSN) and vehicular ad hoc network (VANET) respectively. The experimental results suggest that our proposed algorithm achieves higher accuracy than the other solutions, and the localization error goes down with larger number of recorded jamme作者: cochlea 時(shí)間: 2025-3-22 23:49 作者: Antecedent 時(shí)間: 2025-3-23 04:19 作者: Systemic 時(shí)間: 2025-3-23 06:34
A Cluster Guided Topic Model for Social Query Expansion, of semantic information of context words and word clusters to construct user models for personalized query expansion. Experimental results on a large public social dataset show that the proposed method is more effective than other state-of-the-art baselines.作者: Largess 時(shí)間: 2025-3-23 10:16 作者: 空洞 時(shí)間: 2025-3-23 14:39
Mining Initial Nodes with BSIS Model and BS-G Algorithm on Social Networks for Influence Maximizatiuence maximization named as BS-G (BSIS with Greedy Algorithm) to select the initial node. In the experiments, we use two real social network data sets on the Hadoop and Spark distributed cluster platform for experiments, and the experiment results show that BSIS model and BS-G algorithm on big data 作者: 小溪 時(shí)間: 2025-3-23 20:19
A Multi-objective Optimization Data Scheduling Algorithm for P2P Video Streaming,pose a distributed data scheduling algorithm to solve the multi-objective problem in polynomial time. Through simulations, we show the proposed algorithm outperforms other conventional algorithms in perceived video quality and utilization of peers’ upload capacity.作者: Benign 時(shí)間: 2025-3-24 02:03
A Novel Range-Free Jammer Localization Solution in Wireless Network by Using PSO Algorithm,ulations in two models, which are wireless sensor network (WSN) and vehicular ad hoc network (VANET) respectively. The experimental results suggest that our proposed algorithm achieves higher accuracy than the other solutions, and the localization error goes down with larger number of recorded jamme作者: MUMP 時(shí)間: 2025-3-24 05:54 作者: 名字 時(shí)間: 2025-3-24 06:58 作者: Ophthalmologist 時(shí)間: 2025-3-24 12:07
Extracting Chinese Explanatory Expressions with Discrete and Neural CRFs,two datasets from two different domains which have been annotated with ground-truth explanatory expression. Results show that the neural CRF model performs better than the discrete CRF. After a combination of the discrete and neural features, our final CRF mode achieves the top-performing results.作者: 匍匐 時(shí)間: 2025-3-24 18:18 作者: OUTRE 時(shí)間: 2025-3-24 21:04
An Energy Efficient Routing Protocol for In-Vehicle Wireless Sensor Networks,lity based on residual energy and location distribution of nodes. Then node associate with the cluster head with least communication cost and high residual energy. Simulation results show that ADEEC achieves longer stability period, network lifetime, and throughput than the other classical clustering algorithms.作者: 評(píng)論者 時(shí)間: 2025-3-24 23:27
Energy-Conserving Transmission Network Model Based on Service-Awareness,er to achieve the purpose of energy consumption optimization, we divide the hosts into same VLAN according to their interaction frequency to reduce the cross VLAN transmission consumption. Simulation results show that we get a great energy improvement in the fat tree net topology.作者: 遺產(chǎn) 時(shí)間: 2025-3-25 05:24 作者: Magnificent 時(shí)間: 2025-3-25 11:32 作者: FLIP 時(shí)間: 2025-3-25 14:28
The Importance of a Battle Plantors were asked to choose a correct sentence from a multiple choice list to ensure the high-quality of corpus. The results obtained so far showed that crowdsourcing for constructing CMSC with an evaluation mechanism could be more effective than traditional experiments requiring expertise.作者: 隼鷹 時(shí)間: 2025-3-25 16:17 作者: Gobble 時(shí)間: 2025-3-25 20:25
Average Reward Stochastic Gamesin the keywords of evidence and facts. Calculating the degree of association can work out the connection points of evidence chain relational model. Tabular display and graphical display of evidence chain relational model can be realized.作者: Negligible 時(shí)間: 2025-3-26 00:33
Andrey V. Shevandrin,Alla E. Kalinination Algorithm (DADC). Based on the error of prediction, both algorithms can adaptively adjust the cycle of data collection. Performance evaluation verifies that the proposed algorithms have high performance in terms of accuracy and effectiveness.作者: 六邊形 時(shí)間: 2025-3-26 08:19
Matthias Jeger,Urs Haegler,Roland Theisslation results show that the proposed algorithm improved the coverage quality, and completed the barrier coverage with less node moving distance and lower energy consumption, and achieved the expected coverage requirements and objectives.作者: NUDGE 時(shí)間: 2025-3-26 08:46 作者: Parallel 時(shí)間: 2025-3-26 12:48
Utilizing Crowdsourcing for the Construction of Chinese-Mongolian Speech Corpus with Evaluation Mectors were asked to choose a correct sentence from a multiple choice list to ensure the high-quality of corpus. The results obtained so far showed that crowdsourcing for constructing CMSC with an evaluation mechanism could be more effective than traditional experiments requiring expertise.作者: chlorosis 時(shí)間: 2025-3-26 19:44
A Framework of Mobile Context-Aware Recommender System,tern, in order to find both the user’s long-term behavior pattern and the new trend of his recent behavior, to predict user’s next behavior. Lastly, we discuss the difficulties and future development trend of mobile context-aware recommendation system.作者: Clinch 時(shí)間: 2025-3-26 21:21 作者: aristocracy 時(shí)間: 2025-3-27 03:29 作者: 過分自信 時(shí)間: 2025-3-27 07:48 作者: 截?cái)?nbsp; 時(shí)間: 2025-3-27 11:50
Measurement Analysis of an Indoor Positioning System Based on LTE,can be flexibly deployed on Base Stations (BSs). Additionally, a spatial filtering algorithm without the prior information is proposed to optimize the route tracking. The test results demonstrate that the fixed point positioning error is less than 3?m, and the estimated trajectory is basically accordant with the real path in the dynamic test.作者: 青少年 時(shí)間: 2025-3-27 13:45 作者: semble 時(shí)間: 2025-3-27 21:13 作者: 過去分詞 時(shí)間: 2025-3-27 23:56 作者: 過時(shí) 時(shí)間: 2025-3-28 04:15
Text Understanding with a Hybrid Neural Network Based Learning,constructing sentence as input to convolutional neural network. The recurrent neural network is also used to label the sentences from the original document, and the proposed BAM-GRU model is more efficient. Experimental results show the feasibility of the approach. Some problems and further works are also present in the end.作者: 獎(jiǎng)牌 時(shí)間: 2025-3-28 06:50 作者: 發(fā)炎 時(shí)間: 2025-3-28 10:41
https://doi.org/10.1007/978-1-4302-0733-7s are optimized. Finally, the relevance score of the user reviews are calculated, and whether the user reviews are relevant is judged. Through the experiment, this method is proved that can judge the relevance of App software’s user reviews effectively.作者: Expediency 時(shí)間: 2025-3-28 16:36
Gonzales d’Alcantara,Bernard Amerlyncklity based on residual energy and location distribution of nodes. Then node associate with the cluster head with least communication cost and high residual energy. Simulation results show that ADEEC achieves longer stability period, network lifetime, and throughput than the other classical clustering algorithms.作者: 騷擾 時(shí)間: 2025-3-28 20:38 作者: 種植,培養(yǎng) 時(shí)間: 2025-3-29 02:26
Data Science978-981-10-6388-6Series ISSN 1865-0929 Series E-ISSN 1865-0937 作者: 靦腆 時(shí)間: 2025-3-29 06:13
Beiji Zou,Qilong Han,Zeguang LuIncludes supplementary material: 作者: nuclear-tests 時(shí)間: 2025-3-29 09:27 作者: 暗語 時(shí)間: 2025-3-29 13:08 作者: 胡言亂語 時(shí)間: 2025-3-29 16:10
978-981-10-6387-9Springer Nature Singapore Pte Ltd. 2017作者: 通知 時(shí)間: 2025-3-29 23:31 作者: 粗糙濫制 時(shí)間: 2025-3-30 03:16
,Aktuelle F?lle der Wirtschaftsspionage, strategies in social network. Most existing studies mainly focus on designing efficient algorithms or heuristics to find Top-K influential individuals for static network. However, when the network is evolving over time, the static algorithms have to be re-executed which will incur tremendous execut作者: Ascendancy 時(shí)間: 2025-3-30 04:49
https://doi.org/10.1007/978-1-4302-0733-7Naive Bayesian text classification and term frequency. Firstly, the keywords sets of App software’s user reviews are extracted. Then, the keywords sets are optimized. Finally, the relevance score of the user reviews are calculated, and whether the user reviews are relevant is judged. Through the exp作者: Oligarchy 時(shí)間: 2025-3-30 09:11 作者: Water-Brash 時(shí)間: 2025-3-30 12:50 作者: 紀(jì)念 時(shí)間: 2025-3-30 16:38
https://doi.org/10.1007/978-1-4302-0733-7cted with users and other objects in various ways. Social data provides a perfect platform for personalized Web search. However, it is confronted with a great challenge named vocabulary mismatch problem. To overcome this problem, previous research has proposed many effective approaches utilizing soc作者: Hemiparesis 時(shí)間: 2025-3-30 21:03
The Importance of a Battle Planconstruct a framework integrating following functions: context identification, context reasoning, services or product recommendations and other tasks for the mobile terminal. In this paper, we firstly introduce mobile context awareness theory, and describe the composition of context-aware mobile sys作者: 不連貫 時(shí)間: 2025-3-31 04:34 作者: 無禮回復(fù) 時(shí)間: 2025-3-31 05:25 作者: Irremediable 時(shí)間: 2025-3-31 13:08
Barbara Stallings,Saori N. Katadarent characters effectively, this paper presents a new hybrid neural network model to extract sentence-level summarization from single document, and it allows us to develop an attention based deep neural network that can learn to understand documents with minimal prior knowledge. The proposed model 作者: Critical 時(shí)間: 2025-3-31 13:52 作者: Cursory 時(shí)間: 2025-3-31 20:11
Chile: A Pioneer in Trade Policy. This research is of great application value for advertising, viral marketing and public opinion monitoring. However, we always ignore the tendency of nodes’ behaviors and sentiment in the researches of influence maximization. On general, users’ sentiment determines users behaviors, and users’ beha作者: 抗原 時(shí)間: 2025-4-1 00:44 作者: LUCY 時(shí)間: 2025-4-1 05:29
Gonzales d’Alcantara,Bernard Amerlynckhe nodes to achieve longer network lifetime for In-Vehicle Wireless Sensor Networks (IVWSNs). The algorithm changes the cluster head selection probability based on residual energy and location distribution of nodes. Then node associate with the cluster head with least communication cost and high res作者: Glucose 時(shí)間: 2025-4-1 09:55
https://doi.org/10.1007/978-1-4419-8915-4el in data center networks. Then we use this model to make the net topology integration and classification through the software define network. In order to achieve the purpose of energy consumption optimization, we divide the hosts into same VLAN according to their interaction frequency to reduce th作者: 反話 時(shí)間: 2025-4-1 13:32 作者: 現(xiàn)暈光 時(shí)間: 2025-4-1 15:53
https://doi.org/10.1007/978-1-4615-4044-1ng attacker is useful to address this problem. Some range-based localization schemes depend on the additional hardware of wireless nodes too much, and they can not work in resource-constrained wireless networks. Solutions in range-free localization are being pursued as a cost-effective alternative t作者: Inflated 時(shí)間: 2025-4-1 20:05 作者: 協(xié)迫 時(shí)間: 2025-4-2 02:39
Studies in Contemporary Economics to provide location information for persons and devices. This paper focuses on the research and development of the indoor positioning system based on LTE uplink signal, which consists of transmitter, Location Measurement Unit (LMU) and server. The Sounding Reference Signal (SRS) is employed as the 作者: Factorable 時(shí)間: 2025-4-2 04:40
Extracting Chinese Explanatory Expressions with Discrete and Neural CRFs,ces that account for one certain user opinion. In this paper, we study the extraction of explanatory expressions, by modeling the problem based on conditional random field (CRF). We compare the effectiveness of both discrete and neural features, and further integrate them. We evaluate the models on 作者: 高興去去 時(shí)間: 2025-4-2 07:50
Incremental Influence Maximization for Dynamic Social Networks, strategies in social network. Most existing studies mainly focus on designing efficient algorithms or heuristics to find Top-K influential individuals for static network. However, when the network is evolving over time, the static algorithms have to be re-executed which will incur tremendous execut
