Sciweavers

960 search results - page 178 / 192
» CURE: An Efficient Clustering Algorithm for Large Databases
Sort
View
VLDB
2008
ACM
103views Database» more  VLDB 2008»
15 years 12 months ago
The optimal sequenced route query
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
Mehdi Sharifzadeh, Mohammad R. Kolahdouzan, Cyrus ...
KAIS
2008
114views more  KAIS 2008»
14 years 11 months ago
A new concise representation of frequent itemsets using generators and a positive border
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...
Guimei Liu, Jinyan Li, Limsoon Wong
CORR
2000
Springer
120views Education» more  CORR 2000»
14 years 11 months ago
Scaling Up Inductive Logic Programming by Learning from Interpretations
When comparing inductive logic programming (ILP) and attribute-value learning techniques, there is a trade-off between expressive power and efficiency. Inductive logic programming ...
Hendrik Blockeel, Luc De Raedt, Nico Jacobs, Bart ...
CVPR
2007
IEEE
16 years 1 months ago
Incremental Linear Discriminant Analysis Using Sufficient Spanning Set Approximations
This paper presents a new incremental learning solution for Linear Discriminant Analysis (LDA). We apply the concept of the sufficient spanning set approximation in each update st...
Björn Stenger, Josef Kittler, Roberto Cipolla...
TKDE
2002
111views more  TKDE 2002»
14 years 11 months ago
Query Relaxation by Structure and Semantics for Retrieval of Logical Web Documents
Since WWW encourages hypertext and hypermedia document authoring (e.g. HTML or XML), Web authors tend to create documents that are composed of multiple pages connected with hyperl...
Wen-Syan Li, K. Selçuk Candan, Quoc Vu, Div...