Relational Classification using Multiple View Approach with Voting
TL;DR: Proposed algorithm and experimental results for multiple view approach with voting as a view combination technique for multirelational classification in data mining and machine learning.
read more
Abstract: is an important task in data mining and machine learning, in which a model is generated based on training dataset and that model is used to predict class label of unknown dataset. Various algorithms have been proposed to build accurate and scalable classifiers in data mining. These algorithms are only applied to single table. Today most real- world data are stored in relational format which is popular format for structured data which consist of tables connected via relations (primary key/ foreign key). So single table data mining algorithms cannot deal with relational data. To classify data from relational format need of multirelational classification arise which is used to analyze relational data and used to predict behaviour and unknown pattern automatically. For multirelational classification, various techniques are available which include upgrading existing algorithm, flatten relational data and multiple view approach. Multiple view approach learns from multiple views of a relational data and then combines the result of each view to classify unknown data. This paper presents proposed algorithm and experimental results for multiple view approach with voting as a view combination technique.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Analysis and detection of low quality information in social networks
De Wang
- 19 May 2014
TL;DR: This thesis work introduces social spam analytics and detection framework SPADE across multiple social networks showing the efficiency and flexibility of cross-domain classification and associative classification and provides activity-based detection approaches to filter out low quality information in social networks.
29
SPADE: a social-spam analytics and detection framework
De Wang,Danesh Irani,Calton Pu +2 more
TL;DR: The proposed framework SPADE has numerous benefits including accuracy of spam detection will be improved through cross-domain classification and associative classification; other techniques can be integrated and centralized; and new social networks can plug into the system easily, preventing spam at an early stage.
27
An Approach to Automatically Extract Predictive Properties from Nominal Attributes in Relational Databases
Valentin Kassarnig,Franz Wotawa +1 more
- 01 Dec 2018
TL;DR: This work presents a new approach helping propositionalization methods to extract meaningful features from nominal attributes and improve their predictive performance, and demonstrates that the proposed technique is capable of producing novel features that are highly correlated with the target attribute.
3
Framework for Pre-processing, Feature $\boldsymbol{-}$ extraction, and Specialisation of Nominal Data
Meena Jha
- 18 Dec 2022
TL;DR: In this paper , the authors proposed a framework to process nominal data by transforming nominal attributes into equivalent statistically significant values for any given data domain, which consists of adding domain knowledge, preservation of collected attributes/features, and evaluation of numerical values by identifying co-relations and similarities of the features.
1
References
Classification and regression trees
TL;DR: This article gives an introduction to the subject of classification and regression trees by reviewing some widely available algorithms and comparing their capabilities, strengths, and weakness in two examples.
gSpan: graph-based substructure pattern mining
Xifeng Yan,Jiawei Han +1 more
- 09 Dec 2002
TL;DR: A novel algorithm called gSpan (graph-based substructure pattern mining), which discovers frequent substructures without candidate generation by building a new lexicographic order among graphs, and maps each graph to a unique minimum DFS code as its canonical label.
Top-down induction of first-order logical decision trees
Hendrik Blockeel,Luc De Raedt +1 more
TL;DR: This dissertation discusses the application domain of decision tree learning and extends it towards the first order logic context of Inductive Logic Programming.
793
Patent
Method and apparatus for learning probabilistic relational models having attribute and link uncertainty and for performing selectivity estimation using probabilistic relational models
Daphne Koller,Lise Getoor,Avi Pfeffer,Nir Friedman,Ben Taskar +4 more
- 02 Aug 2001
TL;DR: In this paper, a method and apparatus for learning probabilistic models (PRM's) with attribute uncertainty is presented. But the method is data-driven rather than hypothesis driven and is not suitable for exploratory data analysis.
201