Search results for "Mining"
showing 10 items of 1730 documents
Comparative study of techniques for large-scale feature selection* *This work was suported by a SERC grant GR/E 97549. The first author was also supp…
1994
The combinatorial search problem arising in feature selection in high dimensional spaces is considered. Recently developed techniques based on the classical sequential methods and the (l, r) search called Floating search algorithms are compared against the Genetic approach to feature subset search. Both approaches have been designed with the view to give a good compromise between efficiency and effectiveness for large problems. The purpose of this paper is to investigate the applicability of these techniques to high dimensional problems of feature selection. The aim is to establish whether the properties inferred for these techniques from medium scale experiments involving up to a few tens …
Towards a mean body for apparel design
2016
This paper focuses on shape average with applications to the apparel industry. Apparel industry uses a consensus sizing system; its major concern is to fit most of the population into it. Since anthropometric measures do not grow linearly, it is important to find prototypes to accurately represent each size. This is done using random compact mean sets, obtained from a cloud of 3D points given by a scanner and applying to the sample a previous definition of mean set. Additionally, two approaches to define confidence sets are introduced. The methodology is applied to data obtained from a real anthropometric survey. This paper has been partially supported by the following grants: TIN2009-14392…
A new methodology for Functional Principal Component Analysis from scarce data. Application to stroke rehabilitation.
2015
Functional Principal Component Analysis (FPCA) is an increasingly used methodology for analysis of biomedical data. This methodology aims to obtain Functional Principal Components (FPCs) from Functional Data (time dependent functions). However, in biomedical data, the most common scenario of this analysis is from discrete time values. Standard procedures for FPCA require obtaining the functional data from these discrete values before extracting the FPCs. The problem appears when there are missing values in a non-negligible sample of subjects, especially at the beginning or the end of the study, because this approach can compromise the analysis due to the need to extrapolate or dismiss subje…
A Dynamic Attribute-Based Authentication Scheme
2015
Attribute-based authentication (ABA) is an approach to authenticate users by their attributes, so that users can get authenticated anonymously and their privacy can be protected. In ABA schemes, required attributes are represented by attribute trees, which can be combined with signature schemes to construct ABA schemes. Most attribute trees are built from top to down and can not change with attribute requirement changes. In this paper, we propose an ABA scheme based on down-to-top built attribute trees or dynamic attribute trees, which can change when attribute requirements change. Therefore, the proposed dynamic ABA scheme is more efficient in a dynamic environment by avoiding regenerating…
Combining hashing and enciphering algorithms for epidemiological analysis of gathered data.
2008
Summary Objectives: Compiling individual records coming from different sources is necessary for multi-center studies. Legal aspects can be satisfied by implementing anonymization procedures. When using these procedures with a different key for each study it becomes almost impossible to link records from separate data collections. Methods: The originality of the method relies on the way the combination of hashing and enciphering techniques is performed: like in asymmetric encryption, two keys are used but the private key depends on the patient’s identity. Results: The combination of hashing and enciphering techniques provides a great improvement in the overall security of the proposed scheme…
Modelling Dependencies Between Classifiers in Mobile Masquerader Detection
2004
The unauthorised use of mobile terminals may result in an abuse of sensitive information kept locally on the terminals or accessible over the network. Therefore, there is a need for security means capable of detecting the cases when the legitimate user of the terminal is substituted. The problem of user substitution detection is considered in the paper as a problem of classifying the behaviour of the person interacting with the terminal as originating from the user or someone else. Different aspects of behaviour are analysed by designated one-class classifiers whose classifications are subsequently combined. A modification of majority voting that takes into account some of the dependencies …
A Forecasting Support System Based on Exponential Smoothing
2010
This chapter presents a forecasting support system based on the exponential smoothing scheme to forecast time-series data. Exponential smoothing methods are simple to apply, which facilitates computation and considerably reduces data storage requirements. Consequently, they are widely used as forecasting techniques in inventory systems and business planning. After selecting the most adequate model to replicate patterns of the time series under study, the system provides accurate forecasts which can play decisive roles in organizational planning, budgeting and performance monitoring.
A symbolic distributed event detection scheme for Wireless Sensor Networks
2016
Due to the possibility of extensive and pervasive deployment of many tiny sensor devices in the area of interest, Wireless Sensor Networks (WSNs) result particularly suitable to detect significant events and to react accordingly in industrial and home scenarios. In this context, fuzzy inference systems for event detection in WSNs have proved to be accurate enough in treating imprecise sensory readings to decrease the number of false alarms. Besides reacting to event occurrences, the whole network may infer more information to enrich the event semantics resulting from reasoning processes carried out on the individual nodes. Contextual knowledge, including spatial and temporal relationships, …
Multi-cloud privacy preserving schemes for linear data mining
2015
This paper presents an approach to privacy-preserving data mining that relies upon a relatively simple secret sharing scheme. Its main feature is that users, sensitive data owners, are engaged in the secret sharing operations that protect their privacy. They are grouped in independent clouds connected to a central unit, the data miner, that only manages the aggregated data of each cloud, therefore avoiding the disclosure of information belonging to single nodes. We propose two privacy preserving schemes, with different privacy levels and communication costs. When designing them, we assume that some users' data might become inaccessible during the operation of the privacy preserving protocol…
A hybrid multi-objective optimization algorithm for content based image retrieval
2013
Abstract Relevance feedback methods in CBIR (Content Based Image Retrieval) iteratively use relevance information from the user to search the space for other relevant samples. As several regions of interest may be scattered through the space, an effective search algorithm should balance the exploration of the space to find new potential regions of interest and the exploitation of areas around samples which are known relevant. However, many algorithms concentrate the search on areas which are close to the images that the user has marked as relevant, according to a distance function in the (possibly deformed) multidimensional feature space. This maximizes the number of relevant images retriev…