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

Integrated analysis of CFD simulation data with k-means clustering algorithm for soot formation under varied combustion conditions

引用

APPLIED THERMAL ENGINEERING 2019年 153卷 299-305页

作者： Yu, Wenbin Zhao, Feiyang Yang, Wenming Xu, Hongpeng Natl Univ Singapore Dept Mech Engn 9 Engn Dr 1 Singapore 117575 Singapore

Computational fluid dynamics (CFD) modelling is a scientific tool to provide fluid dynamics and chemical simulation that facilitates understanding of the complex combustion phenomenon in engine studies. With the advance of Machine Learning (ML) technology, the big data from CFD results can be intelligently recognized and classified, thus ease the data post-processing. This study proposed an integrated analysis that uses CFD simulation results of scalar distributions and k-means clustering algorithm to optimally partition engine combustion chamber into different zones. Therefore, the space of combustion chamber was automatically divided into light soot zones and heavy soot zones based on the clustering results on local equivalence ratio (ER) and temperature. Consequently, the surveys of soot mitigation by Reactivity Controlled Compression Ignition (RCCI) engines combustion mode were carried out as well as corresponding sooting tendency by CFD numerical study. The localized soot depositions in each zone under varied combustion boundaries were compared, hence improving the development of control strategy with numerical modellings and machine learning techniques.

关键词： CFD modelling k-means clustering algorithm RCCI engine combustion Soot formation

来源：评论

学校读者我要写书评

暂无评论

Research on Parallel Adaptive Canopy-k-means clustering algorithm for Big Data Mining Based on Cloud Platform

引用

JOURNAL OF GRID COMPUTING 2020年第2期18卷 263-273页

作者： Xia, Dongliang Ning, Feifei He, Weina Pingdingshan Univ Sch Software Pingdingshan 467000 Henan Peoples R China

Firstly, this paper introduces the types of clustering algorithm, and introduces the classical k-means algorithm and canopy algorithm in detail. Then, combining the map reduce computing model and spark cloud computing framework, this paper introduces the parallel Canopy-k-means algorithm after using Canopy algorithm to optimize the initial value of k-means algorithm. However, because Canopy algorithm needs to introduce a new distance threshold parameter T2, and the parameter needs to be set by human experience, it is difficult to determine the parameter artificially for large data, so this paper proposes a parallel adaptive Canopy-k-means algorithm, which can be used in cloud computing framework to determine the distance threshold parameter T2 adaptively based on statistical method. Using the parallelism of Map-Reduce computing model, the parallel Canopy-k-means algorithm is optimized by adaptive parameter estimation, which solves the problem that parameters depend on manual experience selection in Canopy process. After introducing the relevant theories and derivation process of this algorithm, cloud computing experiment platform is built based on the Spark framework, and the contrast experiments were performed using the Stanford Large Network Dataset Collection (SNAP) dataset and self-built Dimension Networks dataset. The experimental results show that the proposed method is effective.

关键词： Big data mining Parallel framework Cloud platform k-means clustering algorithm Canopy algorithm Spark framework

来源：评论

学校读者我要写书评

暂无评论

Identification of new candidate drugs for lung cancer using chemical-chemical interactions, chemical-protein interactions and a k-means clustering algorithm

引用

JOURNAL OF BIOMOLECULAR STRUCTURE & DYNAMICS 2016年第4期34卷 906-917页

作者： Lu, Jing Chen, Lei Yin, Jun Huang, Tao Bi, Yi kong, Xiangyin Zheng, Mingyue Cai, Yu-Dong Yantai Univ Collaborat Innovat Ctr Adv Drug Delivery Syst & B Minist Educ Sch PharmKey Lab Mol Pharmacol & Drug Evaluat Yantai 264005 Peoples R China Shanghai Maritime Univ Coll Informat Engn Shanghai 201306 Peoples R China Shanghai Jiao Tong Univ Sch Med SJTUSM Inst Hlth Sci Key Lab Stem Cell Biol Shanghai 200025 Peoples R China Chinese Acad Sci Shanghai Inst Biol Sci Shanghai 200025 Peoples R China Shanghai Inst Mat Med Drug Discovery & Design Ctr Shanghai 201203 Peoples R China Shanghai Univ Coll Life Sci Shanghai 200444 Peoples R China

Lung cancer, characterized by uncontrolled cell growth in the lung tissue, is the leading cause of global cancer deaths. Until now, effective treatment of this disease is limited. Many synthetic compounds have emerged with the advancement of combinatorial chemistry. Identification of effective lung cancer candidate drug compounds among them is a great challenge. Thus, it is necessary to build effective computational methods that can assist us in selecting for potential lung cancer drug compounds. In this study, a computational method was proposed to tackle this problem. The chemical-chemical interactions and chemical-protein interactions were utilized to select candidate drug compounds that have close associations with approved lung cancer drugs and lung cancer-related genes. A permutation test and k-means clustering algorithm were employed to exclude candidate drugs with low possibilities to treat lung cancer. The final analysis suggests that the remaining drug compounds have potential anti-lung cancer activities and most of them have structural dissimilarity with approved drugs for lung cancer.

关键词： chemical-protein interaction k-means clustering algorithm lung cancer chemical-chemical interaction

来源：评论

学校读者我要写书评

暂无评论

A preliminary study on wellbore flow interpretation of fiber optic vibration signals based on k-means clustering algorithm

引用

SN APPLIED SCIENCES 2022年第8期4卷 1-11页

作者： Wu, Xianzu Gan, Lixiong Yuan, Shixiong Rui, Deng Yangtze Univ Key Lab Oil & Gas Resources & Explorat Technol Minist Educ Wuhan 430100 Hubei Peoples R China

The wellbore flow analysis of optical fiber vibration signal depends on distributed optical fiber logging. Distributed optical fiber logging technology identifies the fluid in the well through distributed optical fiber acoustic sensor (DAS) and distributed optical fiber temperature sensor (DTS). Distributed optical fiber sensor has the advantages of small underground interference, high efficiency and low cost. In this paper, the wellhead data extracted by the distributed optical fiber acoustic sensor is used to calculate the upper bound of the fluid sound frequency band in the pipe by nonlinear least squares fitting. The k-means clustering algorithm is used to cluster the optical fiber vibration signals in the low frequency band. According to the clustering results, the ratio of the optical fiber signal eigenvalues of each production layers is obtained, and the trend of the ratio of the optical fiber signal eigenvalues of each production layers is judged to be close to the trend of the water absorption intensity. Compared with traditional acoustic logging, the wellbore flow analysis using distributed optical fiber acoustic sensor can quickly determine the production contribution of each layer and the change of fluid phase state in the production cycle. Combined with traditional production logging technology, distributed optical fiber logging shows its reliability and accuracy in data collection, logging interpretation and production application. Starting from the principle of distributed optical fiber acoustic sensing technology, this paper briefly expounds the properties of distributed optical fiber acoustic sensor and the principle of injection profile logging, systematically introduces the processing of distributed optical fiber acoustic data, and emphatically introduces the accuracy of k-means clustering algorithm for analyzing distributed optical fiber acoustic signal and qualitative judgment of production layer, which provides a new idea for judging the accura

关键词： Distributed fiber optic acoustic wave sensor Fiber optic vibration signal Nonlinear least squares fitting k-means clustering algorithm Accuracy

来源：评论

学校读者我要写书评

暂无评论

Application of k-means clustering algorithm to improve effectiveness of the results recommended by journal recommender system

引用

SCIENTOMETRICS 2022年第6期127卷 3237-3252页

作者： Vara, Narjes Mirzabeigi, Mahdieh Sotudeh, Hajar Fakhrahmad, Seyed Mostafa Shiraz Univ Dept Knowledge & Informat Sci Sch Educ & Psychol Shiraz Iran RICeST Dept Evaluat & Resource Dev Shiraz Iran Shiraz Univ Sch Educ & Psychol Dept Knowledge & Informat Sci Shiraz Iran Shiraz Univ Dept Comp Sci & Engn Sch Elect & Comp Engn Shiraz Iran

This study investigates to evaluate feasibility of k-means clustering algorithm in order to improve effectiveness of the results recommended by RICEST Journal Finder System. More than 15,000 papers published in filed of engineering journals during 2013-2017 were collected from their websites. Their titles, abstracts and keywords were extracted, normalized and processed in order to form the test body. According to the number of papers collected, using Cochran's formula, 400 papers completely relevant to the subject of each journal were randomly and proportionally selected and entered the system as queries in order to receive the journals recommended by the system before and after k-means clustering algorithm and the results were recorded. Finally, effectiveness of the system results was determined at each stage by leave-one-out cross validation method based on precision at k top ranked results. Also, opinions of subject reviewers on relevance of the target journal were investigated through a questionnaire. Results showed that before data clustering, only 40% of target journal was recommended at the first 3 ranks. But after k-means clustering algorithm, in more than 80% of searches, the target journal was retrieved at the first 3 ranks. Also, effectiveness of the recommendations, according to 210 subject reviewers, after k-means clustering algorithm, showed that more than 80% of the recommended journals are completely relevant to the given paper. According to the study results, data clustering can significantly increase effectiveness of the results recommended by journal recommender systems.

关键词： Journal recommender systems Effectiveness Scalability k-means clustering algorithm RICeST journal finder system

来源：评论

学校读者我要写书评

暂无评论

The new k-windows algorithm for improving the k-means clustering algorithm

引用

JOURNAL OF COMPLEXITY 2002年第1期18卷 375-391页

作者： Vrahatis, MN Boutsinas, B Alevizos, P Pavlides, G Univ Patras UPAIRC Dept Math GR-26500 Patras Greece UOP UPAIRC Dept Business Adm GR-26500 Patras Greece UOP UPAIRC Dept Comp Engn & Inf GR-26500 Patras Greece

The process of partitioning a large set of patterns into disjoint and homogeneous clusters is fundamental in knowledge acquisition. It is called clustering in the literature and it is applied in various fields including data mining, statistical data analysis, compression and vector quantization. The k-means is a very popular algorithm and one of the best for implementing the clustering process. The k-means has a time complexity that is dominated by the product of the number of patterns, the number of clusters, and the number of iterations. Also, it often converges to a local minimum. In this paper, we present an improvement of the k-means clustering algorithm, aiming at a better time complexity and partitioning accuracy. Our approach reduces the number of patterns that need to be examined for similarity, in each iteration, using a windowing technique. The latter is based on well known spatial data structures, namely the range tree, that allows fast range searches. (C) 2002 Elsevier Science (USA).

关键词： k-means clustering algorithm unsupervised teaming data mining range search

来源：评论

学校读者我要写书评

暂无评论

Content-based image retrieval using PSO and k-means clustering algorithm

引用

ARABIAN JOURNAL OF GEOSCIENCES 2015年第8期8卷 6211-6224页

作者： Younus, Zeyad Safaa Mohamad, Dzulkifli Saba, Tanzila Alkawaz, Mohammed Hazim Rehman, Amjad Al-Rodhaan, Mznah Al-Dhelaan, Abdullah Univ Teknol Malaysia Fac Comp Johor Baharu Malaysia Univ Mosul Fac Comp Sci & Math Mosul Iraq Prince Sultan Univ Coll Comp & Informat Sci Riyadh Saudi Arabia Salman Bin Abdulaziz Univ MIS Dept CBA Alkharj Saudi Arabia King Saud Univ Coll Comp & Informat Sci Dept Comp Sci Riyadh Saudi Arabia

In various application domains such as website, education, crime prevention, commerce, and biomedicine, the volume of digital data is increasing rapidly. The trouble appears when retrieving the data from the storage media because some of the existing methods compare the query image with all images in the database;as a result, the search space and computational complexity will increase, respectively. The content-based image retrieval (CBIR) methods aim to retrieve images accurately from large image databases similar to the query image based on the similarity between image features. In this study, a new hybrid method has been proposed for image clustering based on combining the particle swarm optimization (PSO) with k-means clustering algorithms. It is presented as a proposed CBIR method that uses the color and texture images as visual features to represent the images. The proposed method is based on four feature extractions for measuring the similarity, which are color histogram, color moment, co-occurrence matrices, and wavelet moment. The experimental results have indicated that the proposed system has a superior performance compared to the other system in terms of accuracy.

关键词： Content-based image retrieval CBIR k-means clustering algorithm Feature extraction Co-occurrence matrix Similarity index

来源：评论

学校读者我要写书评

暂无评论

Improved k-means clustering algorithm for exploring local protein sequence motifs representing common structural property

IEEE TRANSACTIONS ON NANOBIOSCIENCE

引用

IEEE TRANSACTIONS ON NANOBIOSCIENCE 2005年第3期4卷 255-265页

作者： Zhong, W Altun, G Harrison, R Tai, PC Pan, Y Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA Georgia State Univ Dept Biol Atlanta GA 30303 USA

Information about local protein sequence motifs is very important to the analysis of biologically significant conserved regions of protein sequences. These conserved regions can potentially determine the diverse conformation and activities of proteins. In this work, recurring sequence motifs of proteins are explored with an improved k-means clustering algorithm on a new dataset. The structural similarity of these recurring sequence clusters to produce sequence motifs is studied in order to evaluate the relationship between sequence motifs and their structures. To the best of our knowledge, the dataset used by our research is the most updated dataset among similar studies for sequence motifs. A new greedy initialization method for the k-means algorithm is proposed to improve traditional k-means clustering techniques. The new initialization method tries to choose suitable initial points, which are well separated and have the potential to form high-quality clusters. Our experiments indicate that the improved k-means algorithm satisfactorily increases the percentage of sequence segments belonging to clusters with high structural similarity. Careful comparison of sequence motifs obtained by the improved and traditional algorithms also suggests that the improved k-means clustering algorithm may discover some relatively weak and subtle sequence motifs, which are undetectable by the traditional k-means algorithms. Many biochemical tests reported in the literature show that these sequence motifs are biologically meaningful. Experimental results also indicate that the improved k-means algorithm generates more detailed sequence motifs representing common structures than previous research. Furthermore, these motifs are universally conserved sequence patterns across protein families, overcoming some weak points of other popular sequence motifs. The satisfactory result of the experiment suggests that this new k-means algorithm may be applied to other areas of bioinformatics resea

关键词： k-means clustering algorithm protein structure sequence motif

来源：评论

学校读者我要写书评

暂无评论

Channeling analysis of wavelet threshold processing based on k-means clustering algorithm

引用

ACTA GEOPHYSICA 2023年第5期71卷 2137-2147页

作者： Gan, Lixiong Li, Ming Cai, Wenyuan Li, Jian Chen, Zhanglong Sun, Jian Deng, Rui Yangtze Univ Key Lab Oil & Gas Resources & Explorat Technol Minist Educ Wuhan 430100 Hubei Peoples R China PetroChina Qinghai Oilfield Co Well Testing Co Mangya 817500 Qinghai Peoples R China CNPC Logging Co Ltd Xian 710077 Shaanxi Peoples R China

Through the spectrum noise logging technology, the oil field is dynamically monitored, and according to its simple logging instrument and convenient operation, the position of the outer channeling of the casing can be qualitatively judged by the abnormal noise of the measurement record, and the downhole production status of the water injection well can be accurately diagnosed. Fully grasp the problems of oil casing leakage, outer channeling and packer leakage in water injection wells, and enrich downhole operations. In this paper, the downhole noise signal data are standardized, and the k-means clustering algorithm is used to classify the downhole noise signal according to the correlation coefficient of different frequencies to obtain the low-frequency noise signal, and the low-frequency noise signal is clustered twice to obtain the channeling frequency band and the reservoir fluid frequency band. The accurate channeling frequency range is determined and conforms to the domestic and foreign research data. The channeling frequency band is processed by wavelet threshold, and the useless noise in the channeling frequency band is eliminated. The channeling noise signal curve after processing is analyzed, and the main output layers have an obvious amplitude back channeling. The k-means clustering algorithm is used to analyze the channeling frequency band, and the channeling noise is processed by wavelet threshold. It is a new noise signal curve processing method, which provides a new idea for the spectrum noise logging technology to master the problem of channeling outside the pipe in the water injection well.

关键词： Spectrum noise logging Channeling k-means clustering algorithm Wavelet threshold processing Accuracy

来源：评论

学校读者我要写书评

暂无评论

Mitigate the impact of transmitter finite extinction ratio using k-means clustering algorithm for 16QAM signal

引用

OPTICS COMMUNICATIONS 2018年 409卷 72-76页

作者： Yu, Miao Li, Yan Shu, Tong Zhang, Yifan Hong, Xiaobin Qiu, Jifang Zuo, Yong Guo, Hongxiang Li, Wei Wu, Jian Beijing Univ Posts & Telecommun State Key Lab Informat Photon & Opt Commun Beijing Peoples R China

A method of recognizing 16QAM signal based on k-means clustering algorithm is proposed to mitigate the impact of transmitter finite extinction ratio. There are pilot symbols with 0.39% overhead assigned to be regarded as initial centroids of k-means clustering algorithm. Simulation result in 10 GBaud 16QAM system shows that the proposed method obtains higher precision of identification compared with traditional decision method for finite ER and IQ mismatch. Specially, the proposed method improves the required OSNR by 5.5 dB, 4.5 dB, 4 dB and 3 dB at FEC limit with ER= 12 dB, 16 dB, 20 dB and 24 dB, respectively, and the acceptable bias error and IQ mismatch range is widened by 767% and 360% with ER = 16 dB, respectively. (C) 2017 Elsevier B.V. All rights reserved.

关键词： Extinction ratio k-means clustering algorithm Quadrature amplitude modulation Coherent optical communication

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：