Sciweavers

2878 search results - page 47 / 576
» Learning the Common Structure of Data
Sort
View
ICML
2010
IEEE
13 years 9 months ago
Learning Markov Logic Networks Using Structural Motifs
Markov logic networks (MLNs) use firstorder formulas to define features of Markov networks. Current MLN structure learners can only learn short clauses (4-5 literals) due to extre...
Stanley Kok, Pedro Domingos
TOIS
2002
97views more  TOIS 2002»
13 years 8 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams
ACSC
2006
IEEE
14 years 2 months ago
A framework for visual data mining of structures
Visual data mining has been established to effectively analyze large, complex numerical data sets. Especially, the extraction and visualization of inherent structures such as hie...
Hans-Jörg Schulz, Thomas Nocke, Heidrun Schum...
ICDE
2002
IEEE
206views Database» more  ICDE 2002»
14 years 9 months ago
Exploiting Local Similarity for Indexing Paths in Graph-Structured Data
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
Raghav Kaushik, Pradeep Shenoy, Philip Bohannon, E...
VLSID
2000
IEEE
94views VLSI» more  VLSID 2000»
14 years 26 days ago
A Genetic Algorithm for the Synthesis of Structured Data Paths
The technique presented here achieves simultaneous optimization of schedule time and data path component cost within a structured data path architecture, using a genetic algorithm...
Chittaranjan A. Mandal, R. M. Zimmer