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

Identification of subtype specific biomarkers of clear cell renal cell carcinoma using random forest and greedy algorithm

引用

BIOSYSTEMS 2021年 204卷 104372-104372页

作者： Wu, Yanyan Han, Weishan Xu, Deling Wang, Xiaxia Yang, Jing Lu, Zhengshu Chen, Xu Ding, Yanrui Jiangnan Univ Sch Sci Wuxi 214122 Jiangsu Peoples R China Jiangnan Univ Lab Media Design & Software Technol Wuxi 214122 Jiangsu Peoples R China Jiangnan Univ Key Lab Ind Biotechnol Wuxi 214122 Jiangsu Peoples R China

Suitable biomarkers can be good indicator for cancer subtype. To find biomarkers that can accurately distinguish clear cell renal cell carcinoma (ccRCC) subtypes, we first determined ccRCC subtypes based on the expression of mRNA, miRNA and lncRNA, named clear cell type 1 (ccluster1) and 2 (ccluster2), using three unsupervised clustering algorithms. Besides being associated with the expression pattern derived from the single type of RNA, the differences between subtypes are relevant to the interactions between RNAs. Then, based on ceRNA network, the optimal combination features are selected using random forest and greedy algorithm. Further, in survivalrelated sub-ceRNA, competing gene pairs centering on miR-106a, miR-192, miR-193b, miR-454, miR-32, miR98, miR-143, miR-145, miR-204, miR-424 and miR-1271 can also well identify ccluster1 and ccluster2 with prediction accuracy over 92%. These subtype-specific features potentially enhance the accuracy with which machine learning methods predict specific ccRCC subtypes. Simultaneously, the changes of miR-106 and OIP5AS1 affect cell proliferation and the prognosis of ccluster1. The changes of miR-145 and FAM13A-AS1 in ccluster2 have an effect on cell invasion, apoptosis, migration and metabolism function. Here miR-192 displays a unique characteristic in both subtypes. Two subtypes also display notable differences in diverse pathways. Tumors belonging to ccluster1 are characterized by Fc gamma R-mediated phagocytosis pathway that affects tissue remodeling and repair, whereas those belonging to ccluster2 are characterized by EGFR tyrosine kinase inhibitor resistance pathway that participates in regulation of cell homeostasis. In conclusion, identifying these gene pairs can shed light on therapeutic mechanisms of ccRCC subtypes.

关键词： ccRCC Random forest greedy algorithm Subtype specific biomarker

来源：评论

学校读者我要写书评

暂无评论

An improved snake model based on image gravitation and optimized greedy algorithm

引用

26th Chinese Control Conference

作者： Li Guo You Yanshan Univ Coll Elect Engn Qinhuangdao 066004 Peoples R China

ISBN: (纸本)9787811240559

A improved active contour model is presented in this paper. function of energy and method of numerical value overlap are improved. The problem of the active contour model's sensitivity to its initial position and the poor convergence to boundary concavities which exists in the traditional Snake for curve evolution are solved because Image gravitation term and area term are added in the new model;Snake points rapidly converge near image edge and increased or decreased self-adapted by optimal greedy algorithm. So, The active contour model's sensitivity to its initial position, the poor convergence to boundary concavities which exists in the traditional Snake and sensitivity to noise are solved, and the computational complexity decrease. Experimental results show the new model is efficient and precise.

关键词： image gravitation optimized greedy algorithm snake model

来源：评论

学校读者我要写书评

暂无评论

A Fast Iterative greedy algorithm for MEG Source Localization

A Fast Iterative Greedy Algorithm for MEG Source Localizatio...

引用

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

作者： G. Obregon-Henao B. Babadi C. Lamus E.N. Brown P.L. Purdon 149 13th Street Room 4.013 Charlestown MA 02129 USA Department of Anesthesia Critical Care and Pain Medicine Massachusetts General Hospital USA

ISBN: (纸本)9781457717871

Recent dynamic source localization algorithms for the Magnetoencephalographic inverse problem use cortical spatio-temporal dynamics to enhance the quality of the estimation. However, these methods suffer from high computational complexity due to the large number of sources that must be estimated. In this work, we introduce a fast iterative greedy algorithm incorporating the class of subspace pursuit algorithms for sparse source localization. The algorithm employs a reduced order state-space model resulting in significant computational savings. Simulation studies on MEG source localization reveal substantial gains provided by the proposed method over the widely used minimumnorm estimate, in terms of localization accuracy, with a negligible increase in computational complexity.

关键词： A Fast Iterative greedy algorithm MEG Source Localization

来源：评论

学校读者我要写书评

暂无评论

GPS Signal Acquisition Based on Compressive Sensing and Modified greedy Acquisition algorithm

引用

IEEE ACCESS 2019年 7卷 40445-40453页

作者： He, Guodong Song, Maozhong He, Xin Hu, Yi Nanjing Univ Aeronaut & Astronaut Coll Elect & Informat Engn Nanjing 210016 Jiangsu Peoples R China Anhui Normal Univ Sch Phys & Elect Informat Wuhu 241003 Peoples R China Univ Sci & Technol China Sch Comp Sci & Technol Hefei 230027 Anhui Peoples R China Chuzhou Univ Sch Elect & Elect Engn Chuzhou 239000 Peoples R China

The first task of GPS receiver is to acquire the satellite signal, which tests the all likely 2-D hypotheses of the code phase and the Doppler frequency of the incoming GPS signal. Compressive sensing is a new signal sampling theory, for sparse signal, the signal can be sampled at a lower sampling rate than Nyquist sampling theory. In this paper, a new GPS signal acquisition method is proposed based on compressive sensing. We designed a GPS signal sparse representation dictionary according to the satellite;the position of sparse spike corresponds to the code phase and Doppler frequency. The modified greedy acquisition algorithm that is different from the compressive sensing signal reconstruction, which is used to acquire the GPS satellite. The numerical simulations illustrate that the new method can efficiently acquire the satellite with artificial or real GPS signal. The new method can compress the GPS signal greatly and reduce the transmission energy consumption accordingly, which is hoped to be applied to aircraft or animal monitoring that have little interference noise and need to record GPS data for a long time.

关键词： Compressive sensing GPS acquisition sparse dictionary greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

Sequencing of Refactoring Techniques by greedy algorithm for maximizing Maintainability

Sequencing of Refactoring Techniques by Greedy Algorithm for...

引用

International Conference on Advances in Computing, Communications and Informatics

作者： Sandhya Tarwani Anuradha Chug University School of Information and Communication Technology Guru Gobind Singh Indraprastha University Dwarka New Delhi India

ISBN: (纸本)9781509020300

Software maintainability is the ease with which a software system can be modified to correct faults, improve performance or other attributes of the source code. Bad smells are symptoms of deeper problem that indicates the need for refactoring which is the process of changing internal structure of the software without affecting its external attributes. Applying different refactoring techniques in different parts of a code results in changed maintainability value every time. Therefore, sequence in which refactoring should be applied is important so that optimal results can be obtained. In this study, we have proposed an approach for evaluating sequence of refactoring by with the help of greedy algorithm. The algorithm selects locally optimal solution at each stage with the hope of finding global optimal solution. Different sequences are generated and applied to the source code to calculate sum of software maintainability values. greedy algorithm helps in finding the optimal sequence out of all the search space. We have evaluated the approach with source code having god class, long method, feature envy, long parameter list, data clumps, data class, class hierarchy problem, empty catch block, exception thrown in finally block and nested try statement bad smells which are detected manually. Hence our approach is able to identify sequence for refactoring as well as best refactoring which will increase maintainability and enhance software quality.

关键词： Software Maintainability greedy algorithm Refactoring Sequence Quality Software Metrics

来源：评论

学校读者我要写书评

暂无评论

Skeleton Extraction and greedy-algorithm-Based Path Planning and its Application in UAV Trajectory Tracking

引用

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS 2022年第6期58卷 4953-4964页

作者： Chang, Jianfang Dong, Na Li, Donghui Ip, Wai Hung Yung, Kai Leung Tianjin Univ Sch Elect & Informat Engn Tianjin 300072 Peoples R China Hong Kong Polytech Univ Dept Ind & Syst Engn Hong Kong Peoples R China

Space research is of great significance to increasingly decentralized and distributed space systems, and path planning in space systems has become a research hotspot for maintaining their safety, security, and reliability. To explore the passable path connecting the starting point and the target point, and optimize a smooth trajectory that can be tracked by unmanned aerial vehicles (UAVs) in 3-D space, a skeleton-extraction- and greedy-algorithm-based path planning has been proposed to guide the flight of UAVs. First, the rapidly exploring random tree (RRT) has been introduced for path search. To speed up the path search process, the spatial skeleton extraction method has been introduced to calculate the skeleton of free space The greedy algorithm has been utilized to increase the RRT expansion and reduce unnecessary bends in the path. The skeleton extraction and greedy-algorithm-based Lazy RRT and RRT-Connect have been proposed to build compared experiments. Second, the minimum snap has been applied to generate a smooth flight trajectory, and the flight time is allocated according to the distance between the waypoints. Third, the UAV Simulink model has been established, and the spatial position of the optimized trajectory is tracked. The experimental results prove that the skeleton extraction can significantly speed up the search process, and greedy algorithm can shorten the path length effectively. The minimum snap combined with the time allocation strategy can produce a smooth and feasible path. The UAV Simulink model also proves that the classic proportion-differentiation controller can accurately track the generated trajectory. The greedy algorithm and skeleton extraction reduce the average path length of RRT by 9.780 and 8.251%, respectively. The greedy algorithm and skeleton extraction reduce the average path length of RRT, Lazy RRT, and RRT-Connect by about 10-13%. The greedy algorithm and skeleton extraction reduce the time consumption of RRT by 62.781 and

关键词： Skeleton Planning greedy algorithms Path planning Trajectory tracking Trajectory optimization Autonomous aerial vehicles greedy algorithm rapidly exploring random tree (RRT) Skeleton extraction space research tracking trajectory optimization

来源：评论

学校读者我要写书评

暂无评论

Fault Diagnosis of Roller Bearing Feature Subset Select Based on greedy algorithm

Fault Diagnosis of Roller Bearing Feature Subset Select Base...

引用

22nd Chinese Control and Decision Conference

作者： Min Yong Guo Yi-nan Yan Jun-rong China Univ Min & Technol Coll Informat & Elect Engn Xuzhou 221008 Jiangsu Peoples R China Xuzhou Normal Univ Mech & Elect Engn Inst Xuzhou 221116 Peoples R China

ISBN: (纸本)9781424451821

Because RST 's ablity of data reduction, feature subset selection was translated into the process of data reduction. The condition attributes and decidation attributes of the diagnosis system were reducted, and we received the best training swatch which were cleared up the information of redundance and repetition. greedy algorithm is a method of discretion and a algorithm of attribute reduction. In the article, fault diagnosis data of roller bearing was discreted and was reducted its attribute. The simple and reliable diagnosis rulers were received, and testing samples ralidated the reliability of the rulers.

关键词： RST greedy algorithm Feature Subset Select Fault Diagnosis

来源：评论

学校读者我要写书评

暂无评论

Research on The Maximization of The Equilibrium Influence of Multi-Information Competition Based on greedy algorithm 2020

Research on The Maximization of The Equilibrium Influence of...

引用

Proceedings of the 3rd International Conference on Information Technologies and Electrical Engineering

作者： Yunfei Zhang Jun He Jin Wen Yujian Wang School of Information Engineering Kunming University Kunming china

ISBN: (纸本)9781450388665

In the information age, with the continuous improvement of Internet technology, online information has gradually changed people's way of life and work. Therefore, after understanding the background of the spread of multi-information competition, this paper refers to the influence algorithm based on the cost control mechanism, and studies the maximization of the game equilibrium influence of multi-information competition spread based on the greedy algorithm.

关键词： Game equilibrium More information greedy algorithm Maximize Competitive transmission

来源：评论

学校读者我要写书评

暂无评论

A Modified Simulated Annealing algorithm Based on Principle of the greedy algorithm for Networks with Mobile Nodes

A Modified Simulated Annealing Algorithm Based on Principle ...

引用

International Conference on Modern Problems of Radio Engineering, Telecommunications and Computer Science

作者： Yuliia Pyrih Mykola Kaidan Bohdan Strykhalyuk Viktoriia Zhebka Department of Telecommunication Lviv Polytehnic National University Lviv Ukraine Department of Radioelectronic Devices and Systems Lviv Polytehnic National University Lviv Ukraine Department of Software Engineering State University of Telecommunications Kyiv Ukraine

ISBN: (数字)9781728155661

ISBN: (纸本)9781728155678

A modified simulated annealing algorithm is presented to improve data routing efficiency on mobile nodes, the feature of which is the use of the greedy choice principle to determine data route with the best value of the QoS parameter by deleting / adding nodes in it. To determine the effectiveness of the modified algorithm when creating a data transmission route between the nodes of the network used the concept of relative failure rate of the route. It is shown that the proposed algorithm provides more successful routing at network scalability than the greedy routing algorithm.

关键词： greedy algorithms mobile radio quality of service simulated annealing telecommunication network reliability telecommunication network routing greedy algorithm telecommunication network reliability telecommunication network routing Mobile radios Quality of service simulated annealing simulated annealing algorithm Mobile nodes Network Best value

来源：评论

学校读者我要写书评

暂无评论

Optimization of indoor temperature sensor layout using proper orthogonal decomposition and greedy algorithm

Optimization of indoor temperature sensor layout using prope...

引用

第43届中国控制会议

作者： Zifeng Wang Zixiang Chen Wen Zheng Kangji Li School of Electrical and Information Engineering Jiangsu University

ISBN: (数字)9789887581581

ISBN: (纸本)9798350366907

Accurately estimating the distributed indoor thermal environmental parameters with limited sensors is crucial for indoor environmental quality and building energy efficiency. This study combines proper orthogonal decomposition and greedy algorithm for sensors layout's optimization in a large-space thermal environment. Firstly, choose the initial quantity and positions of sensors, and collect steady temperature field information based on the feasible range of environmental variables;Secondly,extract features from the collected dataset using proper orthogonal decomposition, and determine the optimal number of sensors based on the energy proportion of the eigenvalues;Thirdly, select the sensor positions iteratively based on the correlations of eigenvectors and sensors using greedy algorithm. A field experiment for performance validation is conducted using a matrix of72 temperature sensors in a large cafeteria. By using the collected 27 snapshot datasets, the temperature field can be reconstructed by Linear Stochastic Estimation using only six optimal sensors(steady-state error: 0.2433, RMSE). The proposed POD-greedy optimization strategy is also compared with another heuristic inference method. The better performance shows great potential for engineering practice and applications.

关键词： Large-space building Proper orthogonal decomposition greedy algorithm Sensor layout optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：