Sciweavers

585 search results - page 92 / 117
» Managing Temporal Financial Data in an Extensible Database
Sort
View
KDD
2005
ACM
112views Data Mining» more  KDD 2005»
14 years 8 months ago
Model-based overlapping clustering
While the vast majority of clustering algorithms are partitional, many real world datasets have inherently overlapping clusters. Several approaches to finding overlapping clusters...
Arindam Banerjee, Chase Krumpelman, Joydeep Ghosh,...
KDD
2009
ACM
169views Data Mining» more  KDD 2009»
14 years 2 months ago
On burstiness-aware search for document sequences
As the number and size of large timestamped collections (e.g. sequences of digitized newspapers, periodicals, blogs) increase, the problem of efficiently indexing and searching su...
Theodoros Lappas, Benjamin Arai, Manolis Platakis,...
VLDB
2007
ACM
129views Database» more  VLDB 2007»
14 years 1 months ago
Processing Forecasting Queries
Forecasting future events based on historic data is useful in many domains like system management, adaptive query processing, environmental monitoring, and financial planning. We...
Songyun Duan, Shivnath Babu
WIDM
2004
ACM
14 years 28 days ago
XPath lookup queries in P2P networks
We address the problem of querying XML data over a P2P network. In P2P networks, the allowed kinds of queries are usually exact-match queries over file names. We discuss the exte...
Angela Bonifati, Ugo Matrangolo, Alfredo Cuzzocrea...
AMW
2009
13 years 8 months ago
Identifying Algebraic Properties to Support Optimization of Unary Similarity Queries
Conventional operators for data retrieval are either based on exact matching or on total order relationship among elements. Neither of them is appropriate to manage complex data, s...
Mônica Ribeiro Porto Ferreira, Agma J. M. Tr...