检索结果-内蒙古大学图书馆

International Joint Conference on Neural networks

作者： Xu-Ying Liu Qian-Qian Li Key Laboratory of Computer Network and Information Integration MOE School of Computer Science and Engineering Southeast University

ISBN: (纸本)9781479914821

Class-imbalance is very common in real-world applications. Previous studies focused on binary-class imbalance problem, whereas multi-class imbalance problem is more general and more challenging. Under-sampling is an effective and efficient method for binary-class imbalanced data. But when it is used for multi-class imbalanced data, many more majority class examples are ignored because there are often multiple majority classes, and the minority class often has few data. To utilize the information contained in the majority class examples ignored by under-sampling, this paper proposes a method ChunkCombine. For each majority class, it performs under-sampling multiple times to obtained non-overlapping data chunks, such that they contain the most information that a data sample of the same size can contain. Each data chunk has the same size as the minority class to achieve balance. Then every possible combination of the minority class and each data chunk from every majority class forms a balanced training set. ChunkCombine uses ensemble techniques to learn from the different training sets derived from all the possible combinations. Experimental results show it is better than many other popular methods for multi-class imbalanced data when average accuracy, G-mean and MAUC are used as evaluation measures. Besides, we discuss different evaluation measures and suggest that, a multi-class F-measure Mean F-Measure (MFM) is unsuitable for multi-class imbalanced data in many situations because it is not consistent with the standard F-measure in binary-class case and it is close to accuracy.

关键词： Training Accuracy Boosting Standards Feature extraction Educational institutions

来源：评论

学校读者我要写书评

暂无评论

An dynamic-weighted collaborative filtering approach to address sparsity and adaptivity issues

An dynamic-weighted collaborative filtering approach to addr...

引用

Congress on Evolutionary Computation

作者： Liang Gu Peng Yang Yongqiang Dong Ministry of Education Key Laboratory of Computer Network and Information Integration (Southeast University) Nanjing China

ISBN: (纸本)9781479914869

Recommendation systems, as efficient measures to handle the information overload and personalized service problems, have attracted considerable attention in research community. Collaborative filtering is one of the most successful techniques based on the user-item matrix in recommendation systems. Usually the matrix is extremely sparse due to the massive number of users and items. And the sparsity of users and items tends to differ significantly in degree. The feature of the matrix changes with the variation of users/items data and hence, leads to poor scalability of the recommendation method. This paper proposes a dynamic-weighted collaborative filtering approach (DWCF) to address sparsity and adaptivity issues. In this approach, the relationship between the distributions of similar users and items is considered to get better recommendation, i.e., the contributions of the user part and the item part to recommendation results depend on their similarity ratios. Moreover, the effect strength of different parts is controlled by an averaging parameter. Experiments on MovieLens dataset illustrate that the DWCF approach proposed in this paper can obtain good recommendation result given different conditions of data sparsity and perform better than a user-based predictor, an item-based predictor and a conventional hybrid approach.

关键词： Filtering Collaboration Accuracy Sparse matrices Computational modeling Feature extraction Estimation

来源：评论

学校读者我要写书评

暂无评论

Clock Synchronization in Mobile Ad Hoc networks Based on an Iterative Approximate Byzantine Consensus Protocol

Clock Synchronization in Mobile Ad Hoc Networks Based on an ...

引用

International Conference on Advanced information networking and Applications (AINA)

作者： Chuanyou Li Yun Wang Michel Hurfin Ministry of Education Key Lab of Computer Network & Information Integration Nanjing China Inria Rennes France

We consider the clock synchronization problem in wireless mobile ad hoc networks in the presence of Byzantine nodes. The communication topology is dynamic: nodes move randomly within a geographical area. We propose a clock synchronization protocol which is based on the linear approximate consensus method. Periodically each correct node broadcasts its current timestamp and gathers the timestamps provided by its current neighbors. To cope with the malicious nodes (and to improve the performance when the node density is low), each node keeps the collected timestamps in a local log. As a log may contain values received more or less recently, a transformation technique is introduced to refresh the outdated values. The accuracy of the synchronisation depends on the connectivity among the moving nodes. We use a matrix and vector based representation to model the behavior of the synchronization process and to analyze its accuracy. We show that the deviation between the different clock values can converge towards zero when a particular condition is satisfied infinitely often. The frequency at which the condition is satisfied also impacts the synchronization accuracy. Based on a particular mobility scenario, performance simulations are conducted.

关键词： Synchronization Clocks Vectors Ad hoc networks Protocols Accuracy Real-time systems

来源：评论

学校读者我要写书评

暂无评论

TTL sensitive social-aware routing in mobile opportunistic networks

TTL sensitive social-aware routing in mobile opportunistic n...

引用

Consumer Communications and networking Conference, CCNC IEEE

作者： Yongfeng Huang Yongqiang Dong Sanfeng Zhang Guoxin Wu Ministry of Education China Key Laboratory of Computer Network and Information Integration (Southeast University) Nanjing China

Social characteristics such as community and centrality have been used as forwarding metrics in literature to predict nodes encounter probability in mobile opportunistic networks. However, the community detection and centrality estimation based on cumulative contact does not take the lifetime of messages into consideration. By investigating the periodicity of social characteristics evolution, this paper presents a novel method to calculate the community and centrality metrics of nodes, in time scales of τ-window and time-to-live (TTL), respectively. Such metrics are then exploited in a proposed social-aware routing algorithm, PerEvo, to predict the encounter probability of nodes during the lifetime of the forwarded message. Extensive trace-driven simulation results show that PerEvo improves the message delivery ratio significantly, while keeping a comparable delivery overhead with the existing social-based routing schemes.

关键词： Communities Routing Mobile computing Mobile communication Measurement Estimation Aging

来源：评论

学校读者我要写书评

暂无评论

A Personalized Service Recommendation Algorithm for Service Functionality

A Personalized Service Recommendation Algorithm for Service ...

引用

International Conference on Advanced Cloud and Big Data (CBD)

作者： Wei Li Di Hu Junzhou Luo School of Computer Science and Engineering Key Laboratory of Computer Network Information Integration (Southeast University) Ministry of Education Southeast University Nanjing China

With the increasing number of services on the Internet, it has become a great challenge to help users find services according to their demands. Personalized recommendation technology is an effective way to solve the problem. Existing service recommendation approaches make recommendations among services with same or similar functionalities to meet the non-functional requirements of users, while the functional requirements for service are seldom taken into account and new services that satisfy the needs of users are difficult to be recommended. Therefore, in this paper, we introduce social tags to the process of service recommendation and build service functionality oriented social tags model to describe user preference for service functionality, then we present a personalized service recommendation algorithm for service functionality (PSR-SF). The proposed algorithm first discovers the neighbors of a target user according to services use frequency of users, and then clusters services that have been used by the target user and his neighborhoods by using the functional characteristic vector of services which based on service functionality oriented social tags model. Finally, target user preference for service classes are generated by using service functionality tags use information of users to make recommendations. The experiment results show that the performance of PSR-SF algorithm is better than those existing recommendation algorithms in terms of service recommendation precision, recall and F values.

关键词： Clustering algorithms Training Testing Quality of service Web services History Motion pictures

来源：评论

学校读者我要写书评

暂无评论

MT-NCOR: A practical optimization method for network coded opportunistic routing in WMN

MT-NCOR: A practical optimization method for network coded o...

引用

International Conference on computer Communications and networks (ICCCN)

作者： Xiang Lan Sanfeng Zhang School of Software Engineering Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration in Southeast University Ministry of Education Southeast University Nanjing China

network coded opportunistic routing (NCOR) is a potential communication paradigm in wireless multi-hop networks (WMN) with lossy links. It leverages the multipath diversity of wireless networks and applies network coding to resist random erasures. Related optimization work minimizing transmission cost or maximizing throughput are based on the collision-free assumption, which either requires perfect schedule of MAC layer or only considers low traffic load and thus few packet collisions will occur. However, the assumption doesn't hold true because real WMNs often need to support content distribution service and bear a high level of traffic load, and 802.11 protocols cannot guarantee an ideal schedule with no collisions. In order to achieve an optimal forwarding rate distribution and reduce conflicting packets, this paper proposes a throughput optimization algorithm which takes into consideration the channel capacity and interference between neighboring nodes. Based on this algorithm, we implement a practical NCOR protocol aiming at achieving maximum throughput named MT-NCOR. Through extensive experiments, we show that MT-NCOR outperforms the state-of-art NCOR protocols in both throughput and total cost, especially in networks backing high traffic loads.

关键词： Throughput Optimization Interference Routing Protocols Channel capacity Encoding

来源：评论

学校读者我要写书评

暂无评论

Author Correction: The FLUXNET2015 dataset and the ONEFlux processing pipeline for eddy covariance data

引用

Scientific data 2021年第1期8卷 72页

作者： Gilberto Pastorello Carlo Trotta Eleonora Canfora Housen Chu Danielle Christianson You-Wei Cheah Cristina Poindexter Jiquan Chen Abdelrahman Elbashandy Marty Humphrey Peter Isaac Diego Polidori Markus Reichstein Alessio Ribeca Catharine van Ingen Nicolas Vuichard Leiming Zhang Brian Amiro Christof Ammann M Altaf Arain Jonas Ardö Timothy Arkebauer Stefan K Arndt Nicola Arriga Marc Aubinet Mika Aurela Dennis Baldocchi Alan Barr Eric Beamesderfer Luca Belelli Marchesini Onil Bergeron Jason Beringer Christian Bernhofer Daniel Berveiller Dave Billesbach Thomas Andrew Black Peter D Blanken Gil Bohrer Julia Boike Paul V Bolstad Damien Bonal Jean-Marc Bonnefond David R Bowling Rosvel Bracho Jason Brodeur Christian Brümmer Nina Buchmann Benoit Burban Sean P Burns Pauline Buysse Peter Cale Mauro Cavagna Pierre Cellier Shiping Chen Isaac Chini Torben R Christensen James Cleverly Alessio Collalti Claudia Consalvo Bruce D Cook David Cook Carole Coursolle Edoardo Cremonese Peter S Curtis Ettore D'Andrea Humberto da Rocha Xiaoqin Dai Kenneth J Davis Bruno De Cinti Agnes de Grandcourt Anne De Ligne Raimundo C De Oliveira Nicolas Delpierre Ankur R Desai Carlos Marcelo Di Bella Paul di Tommasi Han Dolman Francisco Domingo Gang Dong Sabina Dore Pierpaolo Duce Eric Dufrêne Allison Dunn Jiří Dušek Derek Eamus Uwe Eichelmann Hatim Abdalla M ElKhidir Werner Eugster Cacilia M Ewenz Brent Ewers Daniela Famulari Silvano Fares Iris Feigenwinter Andrew Feitz Rasmus Fensholt Gianluca Filippa Marc Fischer John Frank Marta Galvagno Mana Gharun Damiano Gianelle Bert Gielen Beniamino Gioli Anatoly Gitelson Ignacio Goded Mathias Goeckede Allen H Goldstein Christopher M Gough Michael L Goulden Alexander Graf Anne Griebel Carsten Gruening Thomas Grünwald Albin Hammerle Shijie Han Xingguo Han Birger Ulf Hansen Chad Hanson Juha Hatakka Yongtao He Markus Hehn Bernard Heinesch Nina Hinko-Najera Lukas Hörtnagl Lindsay Hutley Andreas Ibrom Hiroki Ikawa Marcin Jackowicz-Korczynski Dalibor Janouš Wilma Jans Rachhpal Jassal Shicheng Jiang Tomomichi Kato Myr Computational Research Division Lawrence Berkeley National Laboratory Berkeley CA 94720 USA. gzpastorello@lbl.gov. DIBAF University of Tuscia Viterbo 01100 Italy. Euro-Mediterranean Centre on Climate Change Foundation (CMCC) Lecce 73100 Italy. Climate & Ecosystem Sciences Division Lawrence Berkeley National Laboratory Berkeley CA 94720 USA. Computational Research Division Lawrence Berkeley National Laboratory Berkeley CA 94720 USA. Department of Civil Engineering California State University Sacramento CA 95819 USA. Department of Geography Environment and Spatial Sciences Michigan State University East Lansing MI 48823 USA. Department of Computer Science University of Virginia Charlottesville VA 22904 USA. TERN Ecosystem Processes Menzies Creek VIC3159 Australia. Max Planck Institute for Biogeochemistry Jena 07701 Germany. Laboratoire des Sciences du Climat et de l'Environnement (LSCE) CEA CNRS UVSQ UPSACLAY Gif sur Yvette 91190 France. Key Laboratory of Ecosystem Network Observation and Modeling Institute of Geographic Sciences and Natural Resources Research Chinese Academy of Sciences Beijing 100101 China. Department of Soil Science University of Manitoba Winnipeg MB R3T2N2 Canada. Department of Agroecology and Environment Agroscope Research Institute Zürich 8046 Switzerland. School of Geography and Earth Sciences McMaster University L8S4K1 Hamilton ON Canada. Department of Physical Geography and Ecosystem Science Lund University Lund 22362 Sweden. Department of Agronomy and Horticulture University of Nebraska-Lincoln Lincoln NE 68583 USA. School of Ecosystem and Forest Sciences The University of Melbourne Richmond VIC3121 Australia. Department of Biology Research Group PLECO University of Antwerp Antwerp 2610 Belgium. Joint Research Centre European Commission Ispra 21027 Italy. TERRA Teaching and Research Center University of Liege Gembloux B-5030 Belgium. Finnish Meteorological Institute Helsinki 00560 Finland. ES

来源：评论

学校读者我要写书评

暂无评论

A genetic algorithm for multiple mobile data collectors' path planning in WSNs

A genetic algorithm for multiple mobile data collectors' pat...

引用

2012 International Conference on information Technology and Software Engineering, ITSE 2012

作者： Shen, Zhuowei Cao, Min Key Lab. of Computer Network and Information Integration School of Computer and Engineering Southeast University Nanjing China

ISBN: (纸本)9783642345210

In mobile data collector (MDC)-based wireless sensor networks, we need to design paths for MDCs for better data collection. In this paper, we use predictable mobility pattern and apply a heuristic algorithm to design paths of MDCs. The algorithm aims to make the time cost by MDCs covering the whole network as short as possible. The algorithm is taken by two steps. Firstly, choose the stop points, and then, construct the paths. Both steps are computed using genetic algorithm (GA). In choosing stop points algorithm, improved stochastic tournament selection is adopted to deal with restraints and special fitness is used to enhance differentiation of solutions. An asexual reproduction based GA with 2-opt optimization mechanism is used to construct MDCs' paths. As experiments show, the algorithm proposed in this paper performs better than greedy algorithm. © 2013 Springer-Verlag.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Quantitative Measurement of Coronary Artery Stenosis in CCTA Images Using a 2D Parametric Intensity Model

Quantitative Measurement of Coronary Artery Stenosis in CCTA...

引用

Annual International Conference of the IEEE Engineering in Medicine and Biology Society

作者： Guanyu YANG Xinglou ZHAO Lijun TANG Huzhong SHU Christine TOUMOULIN Lab of Image Science and Technology Key Laboratory of Computer Network and Information Integration (Southeast University) Dept. of Radiology the First Affiliated Hospital of Nanjing Medical University INSERM-U1099 LTSI Universite de Rennes 1

ISBN: (纸本)9781424479276

In this paper, we propose an approach based on 2D vessel model to segment the vessel lumen in three-dimensional coronary computed tomographic angiography (CCTA) images. The 2D parametric intensity model is introduced first to simulate the intensity distribution of vessel lumen with different size in the longitudinal images. Then the Levenberg-Marquardt method is applied to fit the model within a series of region-of interests defined in the longitudinal image. The estimated parameters of the model are employed to define the boundary points of vessel lumen. The detected boundary points of vessel lumen in six longitudinal images are transformed to the cross-sectional planes in order to calculate the degree of stenosis according to the luminal areas. Our proposed method was evaluated in ten CCTA images with ten reported non-calcified stenosis. The degree of each stenosis was computed according to the luminal area and compared with the standard reference given by radiologists. Experimental results show that our method can estimate the degree of stenosis with a high accuracy.

关键词： Image segmentation Arteries Fitting Solid modeling Three-dimensional displays Computational modeling Accuracy

来源：评论

学校读者我要写书评

暂无评论

Implementation and evaluation of a backtracking algorithm for finding all justifications in OWL 2 EL

Implementation and evaluation of a backtracking algorithm fo...

引用

7th Chinese Semantic Web Symposium and the 2nd Chinese Web ScienceConference, CSWS 2013

作者： Zhou, Zhangquan Qi, Guilin Key Laboratory of Computer Network and Information Integration of State Education Ministry School of Computer Science and Engineering Southeast University China

ISBN: (纸本)9783642540240

Finding justifications plays an important role in the development and maintenance of ontologies. It helps users or developers to understand the entailments by presenting the minimal subsets of the ontology which are responsible for the entailment (called justification). In our previous work, we have proposed a backtracking algorithm for finding justifications in description logic ΕL+, which underpins OWL 2 EL, a profile of the latest version of Web Ontology Language (OWL). However, the algorithm is not implemented. In this paper, we implement this algorithm and conduct experiments on some real world ontologies, including Snomed-CT. We compare our algorithm with a black-box algorithm for finding all justification in OWL 2 EL. The experimental results show that in most cases, the backtracking algorithm outperforms the black-box one. © Springer-Verlag Berlin Heidelberg 2013.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：