No abstract is provided for this article.
Single-cell RNA sequencing (scRNA-seq) is an emerging technology for profiling the gene expression of thousands of cells at the single cell resolution. Currently, the labeling of cells in an scRNA-seq dataset is performed by manually characterizing clusters of cells or by fluorescence-activated cell sorting (FACS). Both methods have inherent drawbacks: The first depends on the clustering algorithm used and the knowledge and arbitrary decisions of the annotator, and the second involves an experimental step in addition to the sequencing and cannot be incorporated into the higher throughput scRNA-seq methods. We therefore suggest a different approach for cell labeling, namely, classifying cells from scRNA-seq datasets by using a model transferred from different (previously labeled) datasets. This approach can complement existing methods, and–in some cases–even replace them. Such a transfer-learning framework requires selecting informative features and training a classifier. The specific implementation for the framework that we propose, designated ''CaSTLe–classification of single cells by transfer learning,'' is based on a robust feature engineering workflow and an XGBoost classification model built on these features. Evaluation of CaSTLe against two benchmark feature-selection and classification methods showed that it outperformed the benchmark methods in most cases and yielded satisfactory classification accuracy in a consistent manner. CaSTLe has the additional advantage of being parallelizable and well suited to large datasets. We showed that it was possible to classify cell types using transfer learning, even when the databases contained a very small number of genes, and our study thus indicates the potential applicability of this approach for analysis of scRNA-seq datasets.
In this chapter we discuss how fuzzy logic extends the envelop of the main data mining tasks: clustering, classification, regression and association rules. We begin by presenting a formulation of the data mining using fuzzy logic attributes. Then, for each task, we provide a survey of the main algorithms and a detailed description (i.e. pseudo-code) of the most popular algorithms. There are two main types of uncertainty in supervised learning: statistical and cognitive. Statistical uncertainty deals with the random behavior of nature and all existing data mining techniques can handle the uncertainty that arises (or is assumed to arise) in the natural world from statistical variations or randomness. Cognitive uncertainty, on the other hand, deals with human cognition. Fuzzy set theory, first introduced by Zadeh in 1965, deals with cognitive uncertainty and seeks to overcome many of the problems found in classical set theory. For example, a major problem faced by researchers of control theory is that a small change in input results in a major change in output. This throws the whole control system into an unstable state. In addition there was also the problem that the representation of subjective knowledge was artificial and inaccurate. Fuzzy set theory is an attempt to confront these difficulties and in this chapter we show how it can be used in data mining tasks. Request access from your librarian to read this chapter's full text.
No abstract is provided for this article.
No abstract is provided for this article.
One of the challenges of fault detection in the domain of autonomous physical agents (or Robots) is the handling of unclassified data, meaning, most data sets are not recognized as normal or faulty. This fact makes it very challenging to use collected data as a training set such that learning algorithms would produce a successful fault detection model. Traditionally unsupervised algorithms try to address this challenge. In this paper we present a hybrid approach that combines unsupervised and supervised methods. An unsupervised approach is utilized for classifying a training set, and then by a standard supervised algorithm we build a fault detection model that is much more accurate than the original unsupervised approach. We show promising results on simulated and real world domains.
Nowadays, Deep Neural Networks (DNNs) have become effective for various machine learning tasks. DNNs are known to achieve high accuracy with unstructured data in which each data sample (e.g., image) consists of many raw features (e.g., pixels) of the same type. The effectiveness of this approach diminishes for structured (tabular) data. In most cases, decision tree-based models such as Random Forest (RF) or Gradient Boosting Decision Trees (GBDT) outperform DNNs. In addition, DNNs tend to perform poorly when the number of samples in the dataset is small. This paper introduces Transfer Learning for Tabular Data (TLTD) which utilizes a novel learning architecture designed to extract new features from structured datasets. Using the DNN’s learning capabilities on images, we convert the tabular data into images, then use the distillation technique to achieve better learning. We evaluated our approach with 25 structured datasets, and compared the outcomes to those of RF, eXtreme Gradient Boosting (XGBoost), and Tabnet. The results demonstrate the usefulness of the TLTD approach.
No abstract is provided for this article.
MicroRNAs (miRNAs) play a crucial role in mRNA regulation. Identifying functionally important mRNA targets of a specific miRNA is essential for uncovering its biological function and assisting miRNA–based drug development. Datasets of high-throughput direct bona fide miRNA–target interactions (MTI) exist only for a few model organisms, prompting the need for computational prediction. However, the scarcity of data poses a challenge in training accurate machine learning models for MTI prediction. In this study, we explored the potential of transfer learning technique (with ANN and XGB) to address the limited data challenge by leveraging the similarities in interaction rules between species. Furthermore, we introduced a novel approach called TransferSHAP for estimating the feature importance of transfer learning in tabular dataset tasks. We demonstrated that transfer learning improves MTI prediction accuracy for species with limited datasets and identified the specific interaction features the models employed to transfer information across different species.
Algorithmic decision-making has become deeply ingrained in many domains, yet biases in machine learning models can still produce discriminatory outcomes, often harming unprivileged groups. Achieving fair classification is inherently challenging, requiring a careful balance between predictive performance and ethical considerations. We present FairTTTS, a novel post-processing bias mitigation method inspired by the Tree Test Time Simulation (TTTS) method. Originally developed to enhance accuracy and robustness against adversarial inputs through probabilistic decision-path adjustments, TTTS serves as the foundation for FairTTTS. By building on this accuracy-enhancing technique, FairTTTS mitigates bias and improves predictive performance. FairTTTS uses a distance-based heuristic to adjust decisions at protected attribute nodes, ensuring fairness for unprivileged samples. This fairness-oriented adjustment occurs as a post-processing step, allowing FairTTTS to be applied to pre-trained models, diverse datasets, and various fairness metrics without retraining. Extensive evaluation on seven benchmark datasets shows that FairTTTS outperforms traditional methods in fairness improvement, achieving a 20.96% average increase over the baseline compared to 18.78% for related work, and further enhances accuracy by 0.55%. In contrast, competing methods typically reduce accuracy by 0.42%. These results confirm that FairTTTS effectively promotes more equitable decision-making while simultaneously improving predictive performance.
Privacy-preserving data mining aims to prevent the exposure of sensitive information as a result of mining algorithms. This is commonly achieved by data anonymisation. One way to anonymise data is by adherence to the k-anonymity concept which requires that the probability to identify an individual by linking databases does not exceed 1/k. In this paper, we propose an algorithm which utilises rough set theory to achieve k-anonymity. The basic idea is to partition the original dataset into several disjoint reducts such that each one of them adheres to k-anonymity. We show that it is easier to make each reduct comply with k-anonymity if it does not contain all quasi-identifier attributes. Moreover, our procedure ensures that even if the attacker attempts to rejoin the reducts, the k-anonymity is still preserved. Unlike other algorithms that achieve k-anonymity, the proposed method requires no prior knowledge of the domain hierarchy taxonomy.
The code matrix enables to convert a multi class problem into an ensemble of binary classifiers. We suggest a new un-weighted framework for iteratively extending the code matrix which based on confusion matrix. The confusion matrix holds important information which is exploited by the suggested framework. Evaluating the confusion matrix at each iteration enables to make a decision regarding the next one against all classifier that should be added to the current code matrix. We demonstrate the benefits of the method by applying it to Error Correcting Code based ensemble and to AdbaBoost. We use Orthogonal arrays as the basic code matrix.
No abstract is provided for this article.
It is our great pleasure to welcome you to the 2013 ACM International Workshop on Computational Scientometrics: Theory and Applications -- CSTA'13. This is the first time when the CSTA workshop has been organized in the ACM International Conference on Information and Knowledge Management. The primary goals and objectives of the workshop are to promote both theoretical results and practical applications within digital libraries to better answer questions such as how do research ideas emerge, evolve, or disappear as a topic, what is a good measure of quality of published works, what are the most promising areas of research, how authors connect and influence each other, who are the experts in a field, what works are similar, and who funds a particular research topic. The workshop aims at bringing together researchers with diverse interdisciplinary backgrounds interested in mining the web, large digital libraries and other relevant databases for research related publications and data. The combination of classical bibliometrics and novel text mining provides a synergy unavailable within each approach taken independently. In this proposed workshop, we also focus on bibliometrics analysis by using sophisticated text mining, or natural language processing methods, which will enable researchers to generate innovative research topics, e.g. full-text citation analysis. We expect people interested in the practical applications within digital libraries such as citation analysis and recommendation, scientific and research trends, expert finding, and collaborator recommendation, to attend the CSTA'13 workshop. The call for papers attracted submissions from Europe, Australia, and the United States. The program committee accepted 6 papers that cover topics, including program committees recommendation for academic conferences, collaborators recommendation, and citations classification and labeling. In addition, the program includes a keynote speech by Xiaozhong Liu on Full-text Citation Analysis and its Application.
