Sciweavers

4972 search results - page 219 / 995
» Ranking on graph data
Sort
View
DSP
2007
15 years 6 months ago
Performance comparison between statistical-based and direct data domain STAPs
In the situation that a radar platform is moving very fast, the number of training data used in space-time adaptive processing (STAP) is a major concern. Less number of training d...
Santana Burintramart, Tapan K. Sarkar, Yu Zhang, M...
KDD
2006
ACM
143views Data Mining» more  KDD 2006»
16 years 7 months ago
Algorithms for discovering bucket orders from data
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
Aristides Gionis, Heikki Mannila, Kai Puolamä...
KDD
2002
ACM
169views Data Mining» more  KDD 2002»
16 years 7 months ago
Optimizing search engines using clickthrough data
This paper presents an approach to automatically optimizing the retrieval quality of search engines using clickthrough data. Intuitively, a good information retrieval system shoul...
Thorsten Joachims
FAW
2009
Springer
177views Algorithms» more  FAW 2009»
16 years 1 months ago
Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs
Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of ...
Mohammad Khairul Hasan, Sung-Eui Yoon, Kyung-Yong ...
PKDD
2004
Springer
147views Data Mining» more  PKDD 2004»
15 years 12 months ago
Using a Hash-Based Method for Apriori-Based Graph Mining
The problem of discovering frequent subgraphs of graph data can be solved by constructing a candidate set of subgraphs first, and then, identifying within this candidate set those...
Phu Chien Nguyen, Takashi Washio, Kouzou Ohara, Hi...