CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

A Review: Data mining over Multi-Relations

by Deepak Meena, Hitesh Gupta
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 62 - Number 8
Year of Publication: 2013
Authors: Deepak Meena, Hitesh Gupta
10.5120/10104-4756

Deepak Meena, Hitesh Gupta . A Review: Data mining over Multi-Relations. International Journal of Computer Applications. 62, 8 ( January 2013), 42-45. DOI=10.5120/10104-4756

@article{ 10.5120/10104-4756,
author = { Deepak Meena, Hitesh Gupta },
title = { A Review: Data mining over Multi-Relations },
journal = { International Journal of Computer Applications },
issue_date = { January 2013 },
volume = { 62 },
number = { 8 },
month = { January },
year = { 2013 },
issn = { 0975-8887 },
pages = { 42-45 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume62/number8/10104-4756/ },
doi = { 10.5120/10104-4756 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:11:17.458574+05:30
%A Deepak Meena
%A Hitesh Gupta
%T A Review: Data mining over Multi-Relations
%J International Journal of Computer Applications
%@ 0975-8887
%V 62
%N 8
%P 42-45
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper, Multi-relational data mining enables pattern mining from multiple tables. Multi-relational data mining algorithms can be used as practical proposal to overcome the deficiency of conventional algorithms. Multi-relational data mining algorithms directly extract frequent patterns from different registers in efficient manner without need of transfer the data in a single table will, on the other hand, used the available memory space is not enough to ensure the production of large amounts of data. For this reason, and the use of space, algorithms are an integral care for the prospection of large repositories. The paper provides the overview of multi relation data mining techniques and classification algorithms. It also defines the frequent pattern mining. The presented paper discussed the various architecture and issues related to multi table data mining. A lot of literature has been proposed in this area. Some of them has discussed in this paper.

References
  1. Bowman, M. , Debray, S. K. , and Peterson, L. L. 1993. Reasoning about naming systems. .
  2. Ding, W. and Marchionini, G. 1997 A Study on Video Browsing Strategies. Technical Report. University of Maryland at College Park.
  3. Fröhlich, B. and Plate, J. 2000. The cubic mouse: a new device for three-dimensional input. In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
  4. Tavel, P. 2007 Modeling and Simulation Design. AK Peters Ltd.
  5. Sannella, M. J. 1994 Constraint Satisfaction and Debugging for Interactive User Interfaces. Doctoral Thesis. UMI Order Number: UMI Order No. GAX95-09398. , University of Washington.
  6. Forman, G. 2003. An extensive empirical study of feature selection metrics for text classification. J. Mach. Learn. Res. 3 (Mar. 2003), 1289-1305.
  7. Brown, L. D. , Hua, H. , and Gao, C. 2003. A widget framework for augmented interaction in SCAPE.
  8. Y. T. Yu, M. F. Lau, "A comparison of MC/DC, MUMCUT and several other coverage criteria for logical decisions", Journal of Systems and Software, 2005, in press.
  9. Spector, A. Z. 1989. Achieving application requirements. In Distributed Systems, S. Mullender
Index Terms

Computer Science
Information Sciences

Keywords

Data mining multi relation classification FP tree

Powered by PhDFocusTM