Sciweavers

611 search results - page 107 / 123
» Querying Tree-Structured Data Using Dimension Graphs
Sort
View
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
14 years 8 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
SEMCO
2007
IEEE
14 years 1 months ago
Nested Named Entity Recognition in Historical Archive Text
This paper describes work on Named Entity Recognition (NER), in preparation for Relation Extraction (RE), on data from a historical archive organisation. As is often the case in t...
Kate Byrne
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
13 years 11 months ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang
SEMWEB
2009
Springer
14 years 2 months ago
Functions over RDF Language Elements
Spreadsheet tools are often used in business and private scenarios in order to collect and store data, and to explore and analyze these data by executing functions and aggregation...
Bernhard Schandl
SSDBM
2010
IEEE
142views Database» more  SSDBM 2010»
13 years 5 months ago
Efficient and Adaptive Distributed Skyline Computation
Skyline queries have attracted considerable attention over the last few years, mainly due to their ability to return interesting objects without the need for user-defined scoring f...
George Valkanas, Apostolos N. Papadopoulos