Search

Sequence alignment lies at heart of the bioinformatics. The Smith-Waterman algorithm is one of the key sequence search algorithms and has gained popularity due to improved implementations and rapidly increasing compute power. Recently, the Smith-Waterman algorithm has been successfully mapped onto the emerging general-purpose graphics processing units (GPUs). In this paper, we focused on how to improve the mapping, especially for short query sequences, by better usage of shared memory. We performed and evaluated the proposed method on two different platforms (Tesla C1060 and Tesla K20) and compared it with two classic methods in CUDASW++. Further, the performance on different numbers of threads and blocks has been analyzed. The results showed that the proposed method significantly improves Smith-Waterman algorithm on CUDA-enabled GPUs in proper allocation of block and thread numbers. [ABSTRACT FROM AUTHOR]

Abstract: This paper sampled approximately 9.3 million entries of data, concerning payments from 300,000 credit card customers over the past two years of Bank A in Taiwan. By applying data mining techniques to decipher customers’ behavior and perform risk analysis, the clustering algorithms divides card users into 9 groups of different levels of contributions and risk profiles, according to their consumption patterns. We generalize a set of clustering rules to identify high risk customer groups in advance. Therefore, the proposed suggestions could tell who was a bad risk and either deny their application or, for those who were already cardholders, start shrinking their available credit and increasing minimum payments to squeeze out as much cash as possible before they defaulted. On the other hand, banks are advised to adjust credit limits in a timely manner for the customer groups whose risks are low and contributions are high, in addition to the provision of value added services, in order to enhance earnings. [Copyright &y& Elsevier]

Abstract: In physics, a spectrum is, the series of colored bands diffracted and arranged in the order of their respective wave lengths by the passage of white light through a prism or other diffracting medium. Outside of physics, a spectrum is a condition that is not limited to a specific set of values but can vary infinitely within a continuum. In commerce, an effective visualization tool, especially for stakeholders or managers, is a brand spectrum diagram highlighting where the company’s brands and products are situated compared to other competitors. This paper investigates the research issues on product and brand spectrum in the beverage product market of Taiwan, which proposes using the Apriori algorithm of association rules, and clustering analysis based on an ontology-based data mining approach, for mining customer and product knowledge from the database. Knowledge extracted from data-mining results is illustrated as knowledge patterns, rules, and maps in order to propose suggestions and solutions to beverage firms for possible product development, promotion, and marketing. [Copyright &y& Elsevier]

Credit scoring is playing an increasingly critical role with the rising number of lending operations for micro and small enterprises as well as individuals. A large number of research is primarily based on the combination and construction methods of credit scoring models by the experts. However, different credit data have distinct requirements for the models, and how to automatically search and construct credit scoring models according to credit data has become essential, that is the main concern of this paper. In response to the current challenges for credit scoring research, we proposed an Automatic Credit Scoring Strategy (ACSS), designed a credit assessment platform which includes data import, classification model automatic search, feature selection, hyperparameter optimization, data mining, classification output and other modules. Aiming at the problem of substantial imbalance in credit data, we propose an improved SMOTE algorithm that is capable of generating supplementary data for the lack of minority in credit data, thereby making the credit data distribution well balanced. As for classification model selection, features engineering, parameter optimization and other parts, we further incorporate automatic search ways to reduce manual interaction. We utilize public and self-owned credit data sets to conduct experiments and compare them with the latest credit assessment methods. Extensive experiments have demonstrated that our ACSS method achieves relatively noticeable performance improvements using the German credit dataset, the Taiwan credit dataset and the personal credit dataset for credit scoring. The best results achieved by our proposed method are 0.98, 0.99, 0.895 and 0.901 for MAE, RMSE, accuracy and precision respectively. In addition, the experimental results also show that our proposed improved SMOTE algorithm contributes to the credit scoring performance enhancement. The experimental findings suggest that our proposed ACSS balances automation and accuracy, which can be implemented to the consumption industry to enhance the reliability of credit assessments. • We utilize an improved SMOTE that could decrease the impact of data imbalance that exists in the credit data. • We propose to leverage the credit feature pruning algorithm and memetic optimization algorithm. • We propose an automated credit scoring strategy (ACSS) method with a cost-effective neural architecture search (C-NAS) scheme. [ABSTRACT FROM AUTHOR]