Sciweavers

352 search results - page 14 / 71
» The Latent Relation Mapping Engine: Algorithm and Experiment...
Sort
View
JIIS
2000
111views more  JIIS 2000»
14 years 9 months ago
Multidimensional Index Structures in Relational Databases
Abstract. Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on effi...
Christian Böhm, Stefan Berchtold, Hans-Peter ...
DAWAK
1999
Springer
15 years 1 months ago
Implementation of Multidimensional Index Structures for Knowledge Discovery in Relational Databases
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
IUI
2003
ACM
15 years 2 months ago
A zero-input interface for leveraging group experience in web browsing
The experience of a trusted group of colleagues can help users improve the quality and focus of their browsing and searching activities. How could a system provide such help, when...
Taly Sharon, Henry Lieberman, Ted Selker
AOSD
2007
ACM
15 years 1 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen
EMNLP
2008
14 years 11 months ago
Who is Who and What is What: Experiments in Cross-Document Co-Reference
This paper describes a language-independent, scalable system for both challenges of crossdocument co-reference: name variation and entity disambiguation. We provide system results...
Alex Baron, Marjorie Freedman