Relational Data Mining Through Extraction of Representative Exemplars
نویسندگان
چکیده
With the growing interest on Network Analysis, Relational Data Mining is becoming an emphasized domain of Data Mining. This paper addresses the problem of extracting representative elements from a relational dataset. After defining the notion of degree of representativeness, computed using the Borda aggregation procedure, we present the extraction of exemplars which are the representative elements of the dataset. We use these concepts to build a network on the dataset. We expose the main properties of these notions and we propose two typical applications of our framework. The first application consists in resuming and structuring a set of binary images and the second in mining co-authoring relation in a research team.
منابع مشابه
Audio Data Mining Using Multi-perceptron Artificial Neural Network
-Data mining is the activity of analyzing a given set of data. It is the process of finding patterns from large relational databases. Data mining includes: extract, transform, and load transaction data onto the data warehouse system, store and manage the data in a multidimensional database system, provides data, analyze the data by application software and visual presentation. Audio data contai...
متن کاملFeature extraction in opinion mining through Persian reviews
Opinion mining deals with an analysis of user reviews for extracting their opinions, sentiments and demands in a specific area, which can play an important role in making major decisions in such area. In general, opinion mining extracts user reviews at three levels of document, sentence and feature. Opinion mining at the feature level is taken into consideration more than the other two levels d...
متن کاملAn Efficient and Fast Density Conscious Subspace Clustering using Affinity Propagation
Subspace clustering is an eminent task to detect the clusters in subspaces. Density-based approaches assume the high-density region in the subspace as a cluster, but it creates density divergence problem. The proposed work improves the performance of Density Conscious subspace clustering (DENCOS) by utilizing the Affinity Propagation (AP) algorithm to detect the local densities for a dataset. I...
متن کاملIntegrating Probabilistic Extraction Models and Data Mining to Discover Relations and Patterns in Text
In order for relation extraction systems to obtain human-level performance, they must be able to incorporate relational patterns inherent in the data (for example, that one’s sister is likely one’s mother’s daughter, or that children are likely to attend the same college as their parents). Hand-coding such knowledge can be time-consuming and inadequate. Additionally, there may exist many intere...
متن کاملState of Art of Multi Relational Data Mining Approaches: A Rule Mining Algorithm
In this 21 century is completely called as the information science where the large organizations need useful knowledge. The data mining algorithms look for patterns in data. While most existing data mining approaches look for patterns in a single data table, multi-relational data mining (MRDM) approaches look for patterns that involve multiple tables (relations) from a relational database. The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1207.0833 شماره
صفحات -
تاریخ انتشار 2012