Action recognition via local descriptors and holistic features

X Sun, M Chen, A Hauptmann - 2009 IEEE computer society …, 2009 - ieeexplore.ieee.org
In this paper we propose a unified action recognition framework fusing local descriptors and
holistic features. The motivation is that the local descriptors and holistic features emphasize …

Mining permission request patterns from android and facebook applications

M Frank, B Dong, AP Felt… - 2012 IEEE 12th …, 2012 - ieeexplore.ieee.org
Android and Facebook provide third-party applications with access to users' private data and
the ability to perform potentially sensitive operations (eg, post to a user's wall or place phone …

A Model-Based Approach to Predicting Graduate-Level Performance Using Indicators of Undergraduate-Level Performance.

J Zimmermann, KH Brodersen, HR Heinimann… - Journal of Educational …, 2015 - ERIC
The graduate admissions process is crucial for controlling the quality of higher education,
yet, rules-of-thumb and domain-specific experiences often dominate evidence-based …

Mdl4bmf: Minimum description length for boolean matrix factorization

P Miettinen, J Vreeken - ACM transactions on knowledge discovery from …, 2014 - dl.acm.org
Matrix factorizations—where a given data matrix is approximated by a product of two or more
factor matrices—are powerful data mining tools. Among other tasks, matrix factorizations are …

[PDF][PDF] Multi-assignment clustering for boolean data

M Frank, AP Streich, D Basin, JM Buhmann - The Journal of Machine …, 2012 - jmlr.org
We propose a probabilistic model for clustering Boolean data where an object can be
simultaneously assigned to multiple clusters. By explicitly modeling the underlying …

Role mining with probabilistic models

M Frank, JM Buhman, D Basin - ACM Transactions on Information and …, 2013 - dl.acm.org
Role mining tackles the problem of finding a role-based access control (RBAC)
configuration, given an access-control matrix assigning users to access permissions as …

Selecting the rank of truncated SVD by Maximum Approximation Capacity

M Frank, JM Buhmann - 2011 IEEE international symposium …, 2011 - ieeexplore.ieee.org
Truncated Singular Value Decomposition (SVD) calculates the closest rank-k approximation
of a given input matrix. Selecting the appropriate rank k defines a critical model order choice …

[HTML][HTML] Shift of pairwise similarities for data clustering

M Haghir Chehreghani - Machine Learning, 2023 - Springer
Several clustering methods (eg, Normalized Cut and Ratio Cut) divide the Min Cut cost
function by a cluster dependent factor (eg, the size or the degree of the clusters), in order to …

Predictive modeling of EEG time series for evaluating surgery targets in epilepsy patients

A Steimer, M Müller, K Schindler - Human brain mapping, 2017 - Wiley Online Library
During the last 20 years, predictive modeling in epilepsy research has largely been
concerned with the prediction of seizure events, whereas the inference of effective brain …

Adapted transfer of distance measures for quantitative structure-activity relationships and data-driven selection of source datasets

T Girschick, U Rückert, S Kramer - The Computer Journal, 2013 - ieeexplore.ieee.org
Quantitative structure–activity relationships are regression models relating chemical
structure to biological activity. Such models allow to make predictions for toxicologically …