Filters








124 Hits in 3.3 sec

Data mining, hypergraph transversals, and machine learning (extended abstract)

Dimitrios Gunopulos, Heikki Mannila, Roni Khardon, Hannu Toivonen
1997 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '97  
The second algorithm utilizes a subroutine for hypergraph transversals, and is applicable in more general situations, with complexity close to a lower bound for the problem.  ...  We also relate these problems to the model of exact learning in computational learning theory, and use the correspondence to derive some corollaries.  ...  Acknowledgments We wish to thank Eyal Kushilevitz for pointing out, the work in 03, and Christino Tamon for useful discussions.  ... 
doi:10.1145/263661.263684 dblp:conf/pods/GunopulosKMT97 fatcat:sudsuezy4bcalk5lyrujwtyjqu

A Methodology Based on Rough Set Theory and Hypergraph for the Prediction of Wart Treatment

Hossam A. Nabwey
2020 International journal of engineering research and technology  
After that the principles of hypergraph was applied to determine the minimal transversal of reducts. Finally, a set of generalized rules for wart treatment was extracted.  ...  The proposed methodology based on rough set theory and hypergraph to identify the optimal feature subset for accurate prediction of wart treatment.  ...  Machine learning and data mining algorithms are utilized to analyze large datasets and discover and extract knowledge from them.  ... 
doi:10.37624/ijert/13.3.2020.552-559 fatcat:nfw55jlq7jezfgzwo4xguzquvq

Constructing Iceberg Lattices from Frequent Closures Using Generators [chapter]

Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, Robert Godin
2008 Lecture Notes in Computer Science  
The goal is to extract the precedence relation from a more common mining output, i.e. closures and generators.  ...  We propose here to reverse a method from the latter field using a fundamental property of hypergraph theory.  ...  These three datasets can be found in the UC Irvine Machine Learning Database Repository. The pumsb, C20D10K, and C73D10K datasets contain census data from the PUMS sample file.  ... 
doi:10.1007/978-3-540-88411-8_15 fatcat:2wekdcdr4ncqxnhwdpun75lwpi

Discovery of Emerging Patterns and Their Use in Classification [chapter]

Kotagiri Ramamohanarao, James Bailey
2003 Lecture Notes in Computer Science  
In this paper, we present different varieties of emerging patterns, discuss efficient techniques for their discovery and explain how they can be used in classification.  ...  They are useful as a means of discovering distinctions inherently present amongst a collection datasets and have been shown to be a powerful method for constructing accurate classifiers.  ...  in logic and machine learning. i) .  ... 
doi:10.1007/978-3-540-24581-0_1 fatcat:l5yavdxlovawdfmsmsrdsnsegq

Efficient Mining of Contrast Patterns and Their Applications to Classification

K. Ramamohanarao, J. Bailey, Hongjian Fan
2005 2005 3rd International Conference on Intelligent Sensing and Information Processing  
Pattern mining is amongst the most important and challenging techniques employed in data mining. Patterns are collections of items which satisfy certain properties.  ...  Data mining is one of the most important areas in the 21 century with many wide ranging applications. These include medicine, finance, commerce and engineering.  ...  The hypergraph minimal transversal problem is particularly significant from a data mining perspective.  ... 
doi:10.1109/icisip.2005.1619410 fatcat:mkajvfymuzaqnfdgka3vqbbxwa

Deciding Monotone Duality and Identifying Frequent Itemsets in Quadratic Logspace [article]

Georg Gottlob
2013 arXiv   pre-print
As the monotone duality problem is equivalent to a number of problems in the areas of databases, data mining, and knowledge discovery, the results presented here yield new complexity results for those  ...  This problem is the same as duality testing for hypergraphs, that is, checking whether a hypergraph H consists of precisely all minimal transversals of a simple hypergraph G.  ...  in data mining and in the database area.  ... 
arXiv:1212.1881v3 fatcat:x4d3amjfovhfha7pprr7kz44oa

An Efficient Architecture for Information Retrieval in P2P Context Using Hypergraph [article]

Anis Ismail, Mohamed Quafafou, Nicolas Durand, Mohammad Hajjar
2011 arXiv   pre-print
We use an algorithm MTMINER to extract all minimal transversals of a hypergraph (clusters) for query routing.  ...  The usability of these systems depends on successful techniques to find and retrieve data; however, efficient and effective routing of content-based queries is an emerging problem in P2P networks.  ...  A lot of these algorithms use the links (formalized in [23] ) between minimal transversals, data mining and machine learning.  ... 
arXiv:1108.1378v1 fatcat:gazef72yzzfyfj65i3bnex2hwe

Page 6070 of Mathematical Reviews Vol. , Issue 2002H [page]

2002 Mathematical Reviews  
Multiple transversals naturally arise in 0-1 pro- gramming, while partial transversals are related to data mining and machine learning.  ...  multiple transversals of a hypergraph.  ... 

Generating Partial and Multiple Transversals of a Hypergraph [chapter]

Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
2000 Lecture Notes in Computer Science  
We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and partial transversals.  ...  We show that the hypergraphs of all multiple and all partial transversals are dual-bounded in the sense that in both cases, the size of the dual hypergraph is bounded by a polynomial in the cardinality  ...  The research of the first two authors was supported in part by the Office of Naval Research (Grant N00014-92-J-1375), the National Science Foundation (Grant DMS 98-06389), and DIMACS.  ... 
doi:10.1007/3-540-45022-x_50 fatcat:m2kesrqzqbhqxfrb5ogciqx5uu

Page 5801 of Mathematical Reviews Vol. , Issue 2001H [page]

2001 Mathematical Reviews  
Summary: “We consider two natural generalizations of the no- tion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so-called multiple and partial transver- sals.  ...  multiple transversals of a hypergraph.  ... 

Hypergraph Transversal Computation and Related Problems in Logic and AI [chapter]

Thomas Eiter, Georg Gottlob
2002 Lecture Notes in Computer Science  
In the present paper, we address this problem and its decisional variant, i.e., the recognition of the transversal hypergraph for another hypergraph.  ...  Problem: Hypergraph Transversal (TRANS-HYP) Instance: Two hypergraphs G = (V, E) and H = (V, F ) on a finite set V . Question: Does G = Tr (H) hold ?  ...  Machine Learning and Data Mining Im machine learning, the hypergraph transversal problem is related to problems in learning Boolean functions.  ... 
doi:10.1007/3-540-45757-7_53 fatcat:4zhadiu5xfg3tpf3g47f4ewwqa

A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes

Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, Robert Godin, Alix Boc, Vladimir Makarenkov
2013 Annals of Mathematics and Artificial Intelligence  
mining FGs and precedence, respectively.  ...  In pattern mining and association rule mining, there is a variety of algorithms for mining frequent closed itemsets (FCIs) and frequent generators (FGs), whereas a smaller part further involves the precedence  ...  The Chess and Connect datasets are derived from their respective game steps. The latter three datasets can be found in the UC Irvine Machine Learning Database Repository.  ... 
doi:10.1007/s10472-013-9372-8 fatcat:f54qccrlijaennurk2jw3litem

An Efficient Architecture for Information Retrieval In P2p Context Using Hypergraph

Anis Ismail, Mohamed Quafafou, Nicolas Durand, Mohammad Hajjar
2011 International Journal of Computer Networks & Communications  
We use an algorithm MTMINER to extract all minimal transversals of a hypergraph (clusters) for query routing.  ...  The usability of these systems depends on successful techniques to find and retrieve data; however, efficient and effective routing of content-based queries is an emerging problem in P2P networks.  ...  A lot of these algorithms use the links (formalized in [23] ) between minimal transversals, data mining and machine learning.  ... 
doi:10.5121/ijcnc.2011.3412 fatcat:zqllekb455efbou3rmmyi76v5y

Queries mining for efficient routing in P2P communities [article]

Anis Ismail, Mohamed Quafafou, Nicolas Durand, Gilles Nachouki and Mohammad Hajjar
2011 arXiv   pre-print
This work was attended as an attempt to motivate the use of mining algorithms and hypergraphs context to develop two different methods that improve significantly the efficiency of P2P communications.  ...  In P2P systems a very large number of autonomous computing nodes (the peers) pool together their resources and rely on each other for data and services.  ...  A lot of these algorithms use the links (formalized in [21] ) between minimal transversals, data mining and machine learning.  ... 
arXiv:1109.5679v1 fatcat:gcbzmf7mrbbdtnat6udo6uh5su

Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph

Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
2001 SIAM journal on computing (Print)  
We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and partial transversals.  ...  We also show that the problems of generating all multiple and all partial transversals for a given hypergraph are polynomial-time reducible to the generation of all ordinary transversals for another hypergraph  ...  See Section 5 for related hypergraphs in the data-mining and machine learning literature. Multiple transversals.  ... 
doi:10.1137/s0097539700370072 fatcat:sposncalpbgnbpwwyfpwbkrqma
« Previous Showing results 1 — 15 out of 124 results