Sciweavers

76 search results - page 12 / 16
» Approximate Structural Matching over Ordered XML Documents
Sort
View
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 7 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
KAIS
2008
150views more  KAIS 2008»
13 years 7 months ago
A survey on algorithms for mining frequent itemsets over data streams
The increasing prominence of data streams arising in a wide range of advanced applications such as fraud detection and trend learning has led to the study of online mining of freq...
James Cheng, Yiping Ke, Wilfred Ng
NIPS
2008
13 years 9 months ago
Structured ranking learning using cumulative distribution networks
Ranking is at the heart of many information retrieval applications. Unlike standard regression or classification in which we predict outputs independently, in ranking we are inter...
Jim C. Huang, Brendan J. Frey
IFSA
2007
Springer
133views Fuzzy Logic» more  IFSA 2007»
14 years 1 months ago
Fuzzy Tree Mining: Go Soft on Your Nodes
Tree mining consists in discovering the frequent subtrees from a forest of trees. This problem has many application areas. For instance, a huge volume of data available from the In...
Federico Del Razo López, Anne Laurent, Pasc...
TON
2002
86views more  TON 2002»
13 years 7 months ago
Efficient randomized web-cache replacement schemes using samples from past eviction times
The problem of document replacement in web caches has received much attention in recent research, and it has been shown that the eviction rule "replace the least recently used...
Konstantinos Psounis, Balaji Prabhakar