Variable selection is an important problem in statistics and machine learning. Copula Entropy (CE) is a mathematical concept for measuring statistical independence and has been applied to variable selection recently. In this paper we propose to apply the CE-based method for variable selection to survival analysis. The idea is to measure the correlation between variables and time-to-event with CE and then select variables according to their CE value. Experiments on simulated data and two real cancer data were conducted to compare the proposed method with two related methods: random survival forest and Lasso-Cox. Experimental results showed that the proposed method can select the 'right' variables out that are more interpretable and lead to better prediction performance.

Auditing Data Provenance (ADP), i.e., auditing if a certain piece of data has been used to train a machine learning model, is an important problem in data provenance. The feasibility of the task has been demonstrated by existing auditing techniques, e.g., shadow auditing methods, under certain conditions such as the availability of label information and the knowledge of training protocols for the target model. Unfortunately, both of these conditions are often unavailable in real applications. In this paper, we introduce Data Provenance via Differential Auditing (DPDA), a practical framework for auditing data provenance with a different approach based on statistically significant differentials, i.e., after carefully designed transformation, perturbed input data from the target model's training set would result in much more drastic changes in the output than those from the model's non-training set. This framework allows auditors to distinguish training data from non-training ones without the need of training any shadow models with the help of labeled output data. Furthermore, we propose two effective auditing function implementations, an additive one and a multiplicative one. We report evaluations on real-world data sets demonstrating the effectiveness of our proposed auditing technique.

Internet-delivered psychological treatments (IDPT) are seen as an effective and scalable pathway to improving the accessibility of mental healthcare. Within this context, treatment adherence is an especially pertinent challenge to address due to the reduced interaction between healthcare professionals and patients. In parallel, the increase in regulations surrounding the use of personal data, such as the General Data Protection Regulation (GDPR), makes data minimization a core consideration for real-world implementation of IDPTs. Consequently, this work proposes a Self-Attention-based deep learning approach to perform automatic adherence forecasting, while only relying on minimally sensitive login/logout-timestamp data. This approach was tested on a dataset containing 342 patients undergoing Guided Internet-delivered Cognitive Behavioral Therapy (G-ICBT) treatment. Of these 342 patients, 101 (~30%) were considered non-adherent (dropout) based on the adherence definition used in this work (i.e. at least eight connections to the platform lasting more than a minute over 56 days). The proposed model achieved over 70% average balanced accuracy, after only 20 out of the 56 days (~1/3) of the treatment had elapsed. This study demonstrates that automatic adherence forecasting for G-ICBT, is achievable using only minimally sensitive data, thus facilitating the implementation of such tools within real-world IDPT platforms.

Smart devices have become an integral part of our day-to-day life, from smartphones to IoT devices and smartwatches. They all help our life become convenient in various aspects like fitness, time-tracking, inventory management, and productivity. To provide the services which make their usage desirable, many services feed on data. By collecting the data, the applications can improve their performance benefiting our productivity and service. In this report, we will be picking a few of the data collected from a smartphone's sensors are trying to recognize the activity being performed by the device's owner.

Why We All Need the Next Generation Machine Intelligence, Causal AI and Explainable ML? Today's Narrow and Weak AI of Machine Learning and Data Science is not a Real or True AI, be it large-scale language models as 17bn Turing-NLG, 175bn GPT-3, 1.75T Wu Dao 2.0, big tech ML platforms, recommending engines, digital assistants, self-driving transportation, or lethal autonomous weapon systems (LAWS), autonomous weapon systems (AWS), robotic weapons, killer robots operating in the air, on land, on water, under water, or in space. Its ML/DL algorithms and models are heavily relying on the statistical learning theory instead of causal learning, thus predicting spurious correlations instead of meaningful causation. This makes a critical difference for the whole enterprise, its applications, prospects, and impacts on every parts of human life. We have to be intelligently critical and fully objective as modern science demands it, as far as it concerns all of us and our human future. The AI world has been flooded with a series of gigantic language model projects promoted as the last word in AI.

Are you looking for Best Free Online Data Analytics Courses? If yes, then this article is for you. In this article, you will find the 7 Best Free Online Data Analytics Courses from various platforms. These free data analytics courses will help you to learn data analytics free of cost. All courses are completely free.

We provide the first comprehensive study on how to classify trajectories using only their spatial representations, measured on 5 real-world data sets. Our comparison considers 20 distinct classifiers arising either as a KNN classifier of a popular distance, or as a more general type of classifier using a vectorized representation of each trajectory. We additionally develop new methods for how to vectorize trajectories via a data-driven method to select the associated landmarks, and these methods prove among the most effective in our study. These vectorized approaches are simple and efficient to use, and also provide state-of-the-art accuracy on an established transportation mode classification task. In all, this study sets the standard for how to classify trajectories, including introducing new simple techniques to achieve these results, and sets a rigorous standard for the inevitable future study on this topic.

The task of link prediction aims to solve the problem of incomplete knowledge caused by the difficulty of collecting facts from the real world. GCNs-based models are widely applied to solve link prediction problems due to their sophistication, but GCNs-based models are suffering from two problems in the structure and training process. 1) The transformation methods of GCN layers become increasingly complex in GCN-based knowledge representation models; 2) Due to the incompleteness of the knowledge graph collection process, there are many uncollected true facts in the labeled negative samples. Therefore, this paper investigates the characteristic of the information aggregation coefficient (self-attention) of adjacent nodes and redesigns the self-attention mechanism of the GAT structure. Meanwhile, inspired by human thinking habits, we designed a semi-supervised self-training method over pre-trained models. Experimental results on the benchmark datasets FB15k-237 and WN18RR show that our proposed self-attention mechanism and semi-supervised self-training method can effectively improve the performance of the link prediction task. If you look at FB15k-237, for example, the proposed method improves Hits@1 by about 30%.

Spectral methods offer a tractable, global framework for clustering in graphs via eigenvector computations on graph matrices. Hypergraph data, in which entities interact on edges of arbitrary size, poses challenges for matrix representations and therefore for spectral clustering. We study spectral clustering for nonuniform hypergraphs based on the hypergraph nonbacktracking operator. After reviewing the definition of this operator and its basic properties, we prove a theorem of Ihara-Bass type which allows eigenpair computations to take place on a smaller matrix, often enabling faster computation. We then propose an alternating algorithm for inference in a hypergraph stochastic blockmodel via linearized belief-propagation which involves a spectral clustering step again using nonbacktracking operators. We provide proofs related to this algorithm that both formalize and extend several previous results. We pose several conjectures about the limits of spectral methods and detectability in hypergraph stochastic blockmodels in general, supporting these with in-expectation analysis of the eigeinpairs of our studied operators. We perform experiments in real and synthetic data that demonstrate the benefits of hypergraph methods over graph-based ones when interactions of different sizes carry different information about cluster structure.

Stopwords carry little semantic information and are often removed from text data to reduce dataset size and improve machine learning model performance. Consequently, researchers have sought to develop techniques for generating effective stopword sets. Previous approaches have ranged from qualitative techniques relying upon linguistic experts, to statistical approaches that extract word importance using correlations or frequency-dependent metrics computed on a corpus. We present a novel quantitative approach that employs iterative and recursive feature deletion algorithms to see which words can be deleted from a pre-trained transformer's vocabulary with the least degradation to its performance, specifically for the task of sentiment analysis. Empirically, stopword lists generated via this approach drastically reduce dataset size while negligibly impacting model performance, in one such example shrinking the corpus by 28.4% while improving the accuracy of a trained logistic regression model by 0.25%. In another instance, the corpus was shrunk by 63.7% with a 2.8% decrease in accuracy. These promising results indicate that our approach can generate highly effective stopword sets for specific NLP tasks.