Sciweavers

1959 search results - page 328 / 392
» Document Management as a Database Problem
Sort
View
KDD
2004
ACM
109views Data Mining» more  KDD 2004»
15 years 10 months ago
Identifying early buyers from purchase data
Market research has shown that consumers exhibit a variety of different purchasing behaviors; specifically, some tend to purchase products earlier than other consumers. Identifyin...
Paat Rusmevichientong, Shenghuo Zhu, David Selinge...
KDD
2010
ACM
242views Data Mining» more  KDD 2010»
14 years 11 months ago
A scalable two-stage approach for a class of dimensionality reduction techniques
Dimensionality reduction plays an important role in many data mining applications involving high-dimensional data. Many existing dimensionality reduction techniques can be formula...
Liang Sun, Betul Ceran, Jieping Ye
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
13 years 6 days ago
Optimizing index for taxonomy keyword search
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
15 years 2 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
DGO
2011
237views Education» more  DGO 2011»
13 years 9 months ago
Modeling digital preservation capabilities in enterprise architecture
The rising awareness of the challenges of preserving information over the long term has led to a wealth of initiatives developing economic models, methods, tools, systems, guideli...
Christoph Becker, Gonçalo Antunes, Jos&eacu...