Abstract: Big Data represents the recent technology of manipulating voluminous and unstructured data sets over multiple sources. Therefore, NOSQL appears to handle the problem of unstructured data. Association rules mining is one of the popular techniques of data mining to extract hidden relationship from transactional databases. The algorithm for finding association dependencies is well-solved with Map Reduce. The goal of our work is to reduce the time of generating of frequent itemsets by using Map Reduce and NOSQL database oriented document. A comparative study is given to evaluate the performances of our algorithm with the classical algorithm Apriori.
Abstract: Environmental changes and major natural disasters are
most prevalent in the world due to the damage that humanity has
caused to nature and these damages directly affect the lives of
animals. Thus, the study of animal behavior and their interactions
with the environment can provide knowledge that guides researchers
and public agencies in preservation and conservation actions.
Exploratory analysis of animal movement can determine the patterns
of animal behavior and with technological advances the ability of
animals to be tracked and, consequently, behavioral studies have
been expanded. There is a lot of research on animal movement and
behavior, but we note that a proposal that combines resources and
allows for exploratory analysis of animal movement and provide
statistical measures on individual animal behavior and its interaction
with the environment is missing. The contribution of this paper is
to present the framework AniMoveMineR, a unified solution that
aggregates trajectory analysis and data mining techniques to explore
animal movement data and provide a first step in responding questions
about the animal individual behavior and their interactions with other
animals over time and space. We evaluated the framework through the
use of monitored jaguar data in the city of Miranda Pantanal, Brazil,
in order to verify if the use of AniMoveMineR allows to identify the
interaction level between these jaguars. The results were positive and
provided indications about the individual behavior of jaguars and
about which jaguars have the highest or lowest correlation.
Abstract: Recommendation systems are widely used in
e-commerce applications. The engine of a current recommendation
system recommends items to a particular user based on user
preferences and previous high ratings. Various recommendation
schemes such as collaborative filtering and content-based approaches
are used to build a recommendation system. Most of current
recommendation systems were developed to fit a certain domain such
as books, articles, and movies. We propose1 a hybrid framework
recommendation system to be applied on two dimensional spaces
(User × Item) with a large number of Users and a small number
of Items. Moreover, our proposed framework makes use of both
favorite and non-favorite items of a particular user. The proposed
framework is built upon the integration of association rules mining
and the content-based approach. The results of experiments show
that our proposed framework can provide accurate recommendations
to users.
Abstract: Association rules are an important problem in data
mining. Massively increasing volume of data in real life databases
has motivated researchers to design novel and incremental algorithms
for association rules mining. In this paper, we propose an incremental
association rules mining algorithm that integrates shocking
interestingness criterion during the process of building the model. A
new interesting measure called shocking measure is introduced. One
of the main features of the proposed approach is to capture the user
background knowledge, which is monotonically augmented. The
incremental model that reflects the changing data and the user beliefs
is attractive in order to make the over all KDD process more
effective and efficient. We implemented the proposed approach and
experiment it with some public datasets and found the results quite
promising.
Abstract: The Kansei engineering is a technology which
converts human feelings into quantitative terms and helps designers
develop new products that meet customers- expectation. Standard
Kansei engineering procedure involves finding relationships between
human feelings and design elements of which many researchers have
found forward and backward relationship through various soft
computing techniques. In this paper, we proposed the framework of
Kansei engineering linking relationship not only between human
feelings and design elements, but also the whole part of product, by
constructing association rules. In this experiment, we obtain input
from emotion score that subjects rate when they see the whole part of
the product by applying semantic differentials. Then, association
rules are constructed to discover the combination of design element
which affects the human feeling. The results of our experiment
suggest the pattern of relationship of design elements according to
human feelings which can be derived from the whole part of product.
Abstract: The problem of frequent itemset mining is considered in this paper. One new technique proposed to generate frequent patterns in large databases without time-consuming candidate generation. This technique is based on focusing on transaction instead of concentrating on itemset. This algorithm based on take intersection between one transaction and others transaction and the maximum shared items between transactions computed instead of creating itemset and computing their frequency. With applying real life transactions and some consumption is taken from real life data, the significant efficiency acquire from databases in generation association rules mining.
Abstract: Most of the existing text mining approaches are
proposed, keeping in mind, transaction databases model. Thus, the
mined dataset is structured using just one concept: the “transaction",
whereas the whole dataset is modeled using the “set" abstract type. In
such cases, the structure of the whole dataset and the relationships
among the transactions themselves are not modeled and
consequently, not considered in the mining process.
We believe that taking into account structure properties of
hierarchically structured information (e.g. textual document, etc ...)
in the mining process, can leads to best results. For this purpose, an
hierarchical associations rule mining approach for textual documents
is proposed in this paper and the classical set-oriented mining
approach is reconsidered profits to a Direct Acyclic Graph (DAG)
oriented approach. Natural languages processing techniques are used
in order to obtain the DAG structure. Based on this graph model, an
hierarchical bottom up algorithm is proposed. The main idea is that
each node is mined with its parent node.