average rank
Recently Published Documents


TOTAL DOCUMENTS

43
(FIVE YEARS 10)

H-INDEX

6
(FIVE YEARS 1)

2022 ◽  
Vol 19 (1) ◽  
pp. 1719
Author(s):  
Saravanan Arumugam ◽  
Sathya Bama Subramani

With the increase in the amount of data and documents on the web, text summarization has become one of the significant fields which cannot be avoided in today’s digital era. Automatic text summarization provides a quick summary to the user based on the information presented in the text documents. This paper presents the automated single document summarization by constructing similitude graphs from the extracted text segments. On extracting the text segments, the feature values are computed for all the segments by comparing them with the title and the entire document and by computing segment significance using the information gain ratio. Based on the computed features, the similarity between the segments is evaluated to construct the graph in which the vertices are the segments and the edges specify the similarity between them. The segments are ranked for including them in the extractive summary by computing the graph score and the sentence segment score. The experimental analysis has been performed using ROUGE metrics and the results are analyzed for the proposed model. The proposed model has been compared with the various existing models using 4 different datasets in which the proposed model acquired top 2 positions with the average rank computed on various metrics such as precision, recall, F-score. HIGHLIGHTS Paper presents the automated single document summarization by constructing similitude graphs from the extracted text segments It utilizes information gain ratio, graph construction, graph score and the sentence segment score computation Results analysis has been performed using ROUGE metrics with 4 popular datasets in the document summarization domain The model acquired top 2 positions with the average rank computed on various metrics such as precision, recall, F-score GRAPHICAL ABSTRACT


2021 ◽  
Vol vol. 23, no. 3 (Graph Theory) ◽  
Author(s):  
Ke Liu ◽  
Mei Lu

Let $H=(V,F)$ be a simple hypergraph without loops. $H$ is called linear if $|f\cap g|\le 1$ for any $f,g\in F$ with $f\not=g$. The $2$-section of $H$, denoted by $[H]_2$, is a graph with $V([H]_2)=V$ and for any $ u,v\in V([H]_2)$, $uv\in E([H]_2)$ if and only if there is $ f\in F$ such that $u,v\in f$. The treewidth of a graph is an important invariant in structural and algorithmic graph theory. In this paper, we consider the treewidth of the $2$-section of a linear hypergraph. We will use the minimum degree, maximum degree, anti-rank and average rank of a linear hypergraph to determine the upper and lower bounds of the treewidth of its $2$-section. Since for any graph $G$, there is a linear hypergraph $H$ such that $[H]_2\cong G$, we provide a method to estimate the bound of treewidth of graph by the parameters of the hypergraph.


Sensors ◽  
2021 ◽  
Vol 21 (5) ◽  
pp. 1894
Author(s):  
Jiangzhong Cao ◽  
Yunfei Huang ◽  
Qingyun Dai ◽  
Wing-Kuen Ling

Aiming at the high cost of data labeling and ignoring the internal relevance of features in existing trademark retrieval methods, this paper proposes an unsupervised trademark retrieval method based on attention mechanism. In the proposed method, the instance discrimination framework is adopted and a lightweight attention mechanism is introduced to allocate a more reasonable learning weight to key features. With an unsupervised way, this proposed method can obtain good feature representation of trademarks and improve the performance of trademark retrieval. Extensive comparative experiments on the METU trademark dataset are conducted. The experimental results show that the proposed method is significantly better than traditional trademark retrieval methods and most existing supervised learning methods. The proposed method obtained a smaller value of NAR (Normalized Average Rank) at 0.051, which verifies the effectiveness of the proposed method in trademark retrieval.


2021 ◽  
Author(s):  
Jiahua Rao ◽  
Shuangjia Zheng ◽  
Ying Song ◽  
Jianwen Chen ◽  
Chengtao Li ◽  
...  

AbstractSummaryRecently, novel representation learning algorithms have shown potential for predicting molecular properties. However, unified frameworks have not yet emerged for fairly measuring algorithmic progress, and experimental procedures of different representation models often lack rigorousness and are hardly reproducible. Herein, we have developed MolRep by unifying 16 state-of-the-art models across 4 popular molecular representations for application and comparison. Furthermore, we ran more than 12.5 million experiments to optimize hyperparameters for each method on 12 common benchmark data sets. As a result, CMPNN achieves the best results ranked the 1st in 5 out of 12 tasks with an average rank of 1.75. Relatively, ECC has good performance in classification tasks and MAT good for regression (both ranked 1st for 3 tasks) with an average rank of 2.71 and 2.6, respectively.AvailabilityThe source code is available at: https://github.com/biomed-AI/MolRepSupplementary informationSupplementary data are available online.


2020 ◽  
Vol 12 (24) ◽  
pp. 4134
Author(s):  
Wenbin Li ◽  
Xuanmei Fan ◽  
Faming Huang ◽  
Wei Chen ◽  
Haoyuan Hong ◽  
...  

To study the uncertainties of a collapse susceptibility prediction (CSP) under the coupled conditions of different data-based models and different connection methods between collapses and environmental factors, An’yuan County in China with 108 collapses is used as the study case, and 11 environmental factors are acquired by data analysis of Landsat TM 8 and high-resolution aerial images, using a hydrological and topographical spatial analysis of Digital Elevation Modeling in ArcGIS 10.2 software. Accordingly, 20 coupled conditions are proposed for CSP with five different connection methods (Probability Statistics (PSs), Frequency Ratio (FR), Information Value (IV), Index of Entropy (IOE) and Weight of Evidence (WOE)) and four data-based models (Analytic Hierarchy Process (AHP), Multiple Linear Regression (MLR), C5.0 Decision Tree (C5.0 DT) and Random Forest (RF)). Finally, the CSP uncertainties are assessed using the area under receiver operation curve (AUC), mean value, standard deviation and significance test, respectively. Results show that: (1) the WOE-based models have the highest AUC accuracy, lowest mean values and average rank, and a relatively large standard deviation; the mean values and average rank of all the FR-, IV- and IOE-based models are relatively large with low standard deviations; meanwhile, the AUC accuracies of FR-, IV- and IOE-based models are consistent but higher than those of the PS-based model. Hence, the WOE exhibits a greater spatial correlation performance than the other four methods. (2) Among all the data-based models, the RF model has the highest AUC accuracy, lowest mean value and mean rank, and a relatively large standard deviation. The CSP performance of the RF model is followed by the C5.0 DT, MLR and AHP models, respectively. (3) Under the coupled conditions, the WOE-RF model has the highest AUC accuracy, a relatively low mean value and average rank, and a high standard deviation. The PS-AHP model is opposite to the WOE-RF model. (4) In addition, the coupled models show slightly better CSP performances than those of the single data-based models not considering connect methods. The CSP performance of the other models falls somewhere in between. It is concluded that the WOE-RF is the most appropriate coupled condition for CSP than the other models.


2020 ◽  
Vol 34 (5) ◽  
pp. 443-453 ◽  
Author(s):  
Olusola Ayandele ◽  
Olugbenga A Popoola ◽  
Tolulope O Oladiji

PurposeThis study examined the prevalence and relationship between addictive use of smartphones and symptoms of depression and anxiety among female undergraduates.Design/methodology/approachStandardized scales were used to measure the addictive use of smartphones, depression and anxiety among 398 female students (mean age 21.75 years, SD = 2.67) at two large higher institutions in southwest Nigeria and were opportunely sampled. Two hypotheses were tested using Spearman's rho and Mann–Whitney U tests.FindingsThe results showed that 1.01% of the respondents were probable smartphone addicts and 17.34% were at-risk, while 14.32% and 16.33% manifested symptoms of anxiety and moderate-to-severe depression, respectively. Depression (r = 0.24, p < 0.01) and anxiety (r = 0.21, p < 0.01) have significant relationship with addictive use of smartphone. Addictive/at-risk smartphone users significantly scored higher on symptoms of depression (average rank of 233.40) than normal smartphone users (average rank of 191.88); U = 9387.50; z = −2.81, p < 0.05; Also, addictive/at-risk smartphone users reported significantly higher level of anxiety (average rank of 229.27) than normal smartphone users (average rank of 192.81); U = 9689.00; z = −2.46, p < 0.05.Research limitations/implicationsGeneralizing these results to a clinical setting and other at-risk demographic groups might prove difficult due to the respondents' condition of homogeneity.Practical implicationsThe findings suggest that relationships exist between the addictive use of smartphones and symptoms of depression and anxiety among undergraduate students in southwest Nigeria. Clinicians should assess smartphone use in the management of depression and anxiety disorders.Social implicationsUniversity administrators should target prevention and intervention strategies that would assist students to be taught positive ways of using their smartphones.Originality/valueThe study contributes to the body of knowledge by revealing relationships between smartphone addiction and mental health in an African sample.


2020 ◽  
Author(s):  
Muhammad Shoaib ◽  
Edorado Giacopuzzi ◽  
Oliver Pain ◽  
Chiara Fabbri ◽  
Chiara Magri ◽  
...  

AbstractIn clinical practice, antidepressant prescription is a trial and error approach, which is time consuming and discomforting for patients. This study investigated an in-silico approach for ranking antidepressants based on their hypothetical likelihood of efficacy.We determined the transcriptomic profile of citalopram remitters by performing a transcriptomic-wide association study on STAR*D data (N =1163). The transcriptional profile of remitters was compared with 21 antidepressant-induced gene expression profiles in five human cell lines available in the connectivity map database. Spearman correlation, Pearson correlation, and the Kolmogorov Smirnov test were used to determine the similarity between antidepressant-induced profiles and remitter profiles, subsequently calculating the average rank of antidepressants across the three methods and a p-value for each rank by using a permutation procedure. The drugs with the top ranks were those having high positive correlation with the expression profiles of remitters and they may have higher chances of efficacy in the tested patients.In MCF7 (breast cancer cell line), escitalopram had the highest average rank, with an average rank higher than expected by chance (p=0.0014). In A375 (human melanoma) and PC3 (prostate cancer) cell lines, escitalopram and citalopram emerged as the second highest ranked antidepressants, respectively (p=0.0310 and 0.0276, respectively). In HA1E (kidney) and HT29 (colon cancer) cell types, citalopram and escitalopram did not fall among top antidepressants.The correlation between citalopram remitters’ and (es)citalopram-induced expression profiles in three cell lines suggests that our approach may be useful and with future improvements it can be applicable at the individual level to tailor treatment prescription.


2019 ◽  
Vol 20 (1) ◽  
Author(s):  
Hatice Kök ◽  
Ayse Merve Acilar ◽  
Mehmet Said İzgi

Abstract Background Growth and development can be determined by cervical vertebrae stages that were defined on the cephalometric radiograph. Artificial intelligence has the ability to perform a variety of activities, such as prediction-classification in many areas of life, by using different algorithms, In this study, we aimed to determine cervical vertebrae stages (CVS) for growth and development periods by the frequently used seven artificial intelligence classifiers, and to compare the performance of these algorithms with each other. Methods Cephalometric radiographs, that were obtained from 300 individuals aged between 8 and 17 years were included in our study. Nineteen reference points were defined on second, third, and 4th cervical vertebrae, and 20 different linear measurements were taken. Seven algorithms of artificial intelligence that are frequently used in the field of classification were selected and compared. These algorithms are k-nearest neighbors (k-NN), Naive Bayes (NB), decision tree (Tree), artificial neural networks (ANN), support vector machine (SVM), random forest (RF), and logistic regression (Log.Regr.) algorithms. Results According to confusion matrices decision tree, CSV1 (97.1%)–CSV2 (90.5%), SVM: CVS3 (73.2%)–CVS4 (58.5%), and kNN: CVS 5 (60.9%)–CVS 6 (78.7%) were the algorithms with the highest accuracy in determining cervical vertebrae stages. The ANN algorithm was observed to have the second-highest accuracy values (93%, 89.7%, 68.8%, 55.6%, and 78%, respectively) in determining all stages except CVS5 (47.4% third highest accuracy value). According to the average rank of the algorithms in predicting the CSV classes, ANN was the most stable algorithm with its 2.17 average rank. Conclusion In our experimental study, kNN and Log.Regr. algorithms had the lowest accuracy values. SVM-RF-Tree and NB algorithms had varying accuracy values. ANN could be the preferred method for determining CVS.


2019 ◽  
Vol 8 (2S11) ◽  
pp. 2876-2879

The object of this study is to understand the gap between the performance of management graduates and employer’s expectations from them. It is measured through KSA (Knowledge, Skills and Attitudes) approach for the services industry. The questionnaire was distributed to 210 Human Resource Professionals from different spectrum identified through convenience sampling method. Data analysed using Chi-square test, U-test and Weighted average rank. The findings indicated that to reduce a gap institute should increase an institute Industry interactions through Industrial visits, Lectures, etc., The Industry expectations are quite high so, the universities and institutes design curriculum based on the Industry expectations and review the knowledge imparting strategies.


Sign in / Sign up

Export Citation Format

Share Document