Sciweavers

2382 search results - page 54 / 477
» Generating Seeded Trees from Data Sets
Sort
View
VLSID
2007
IEEE
231views VLSI» more  VLSID 2007»
16 years 4 months ago
AHIR: A Hardware Intermediate Representation for Hardware Generation from High-level Programs
We present AHIR, an intermediate representation (IR), that acts as a transition layer between software compilation and hardware synthesis. Such a transition layer is intended to t...
Sameer D. Sahasrabuddhe, Hakim Raja, Kavi Arya, Ma...
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
16 years 4 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
SAINT
2005
IEEE
15 years 9 months ago
Learning Logic Wrappers for Information Extraction from the Web
This paper discusses a methodology for applying general-purpose first-order inductive learning to extract information from Web documents structured as unranked ordered trees. The...
Costin Badica, Elvira Popescu, Amelia Badica
ASC
2011
14 years 11 months ago
A rough set approach to multiple dataset analysis
In the area of data mining, the discovery of valuable changes and connections (e.g., causality) from multiple data sets has been recognized as an important issue. This issue essen...
Ken Kaneiwa
ICDM
2006
IEEE
134views Data Mining» more  ICDM 2006»
15 years 10 months ago
Fast Frequent Free Tree Mining in Graph Databases
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
Peixiang Zhao, Jeffrey Xu Yu