Sciweavers

2878 search results - page 177 / 576
» Learning the Common Structure of Data
Sort
View
DEXAW
2006
IEEE
153views Database» more  DEXAW 2006»
15 years 10 months ago
Extracting Partition Statistics from Semistructured Data
The effective grouping, or partitioning, of semistructured data is of fundamental importance when providing support for queries. Partitions allow items within the data set that sh...
John N. Wilson, Richard Gourlay, Robert Japp, Math...
KDD
1998
ACM
102views Data Mining» more  KDD 1998»
15 years 8 months ago
Defining the Goals to Optimise Data Mining Performance
In many data mining problems the definition of what structures in the database are to be regarded as interesting or valuable is given only loosely. Typically this is regarded as a...
Mark G. Kelly, David J. Hand, Niall M. Adams
VL
1998
IEEE
116views Visual Languages» more  VL 1998»
15 years 8 months ago
Programming Web-Based Applications within a Data-Flow VL
This paper shows how a general purpose data flow visual programming environment can be effectively used to find, collect and manipulate information available on the web. The discu...
Roberto Idini, Mauro Mosconi, Marco Porta
ICWE
2005
Springer
15 years 9 months ago
Level of Detail Concepts in Data-Intensive Web Applications
Abstract. Current data-intensive Web applications, such as on-line trading, ecommerce, corporate portals and so on, are becoming more and more complex, both in terms of density of ...
Sara Comai
AAAI
2006
15 years 5 months ago
Embedding Heterogeneous Data Using Statistical Models
Embedding algorithms are a method for revealing low dimensional structure in complex data. Most embedding algorithms are designed to handle objects of a single type for which pair...
Amir Globerson, Gal Chechik, Fernando Pereira, Naf...