Sciweavers

1458 search results - page 31 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
ICDM
2009
IEEE
168views Data Mining» more  ICDM 2009»
14 years 3 months ago
Bi-relational Network Analysis Using a Fast Random Walk with Restart
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
Jing Xia, Doina Caragea, William H. Hsu
ECAI
2006
Springer
14 years 4 days ago
Efficient Knowledge Acquisition for Extracting Temporal Relations
Abstract. Machine learning approaches in natural language processing often require a large annotated corpus. We present a complementary approach that utilizes expert knowledge to o...
Son Bao Pham, Achim G. Hoffmann
VLDB
1999
ACM
159views Database» more  VLDB 1999»
14 years 21 days ago
Aggregation Algorithms for Very Large Compressed Data Warehouses
Many efficient algorithms to compute multidimensional aggregation and Cube for relational OLAP have been developed. However, to our knowledge, there is nothing to date in the lite...
Jianzhong Li, Doron Rotem, Jaideep Srivastava
BMCBI
2005
152views more  BMCBI 2005»
13 years 8 months ago
GeneKeyDB: A lightweight, gene-centric, relational database to support data mining environments
Background: The analysis of biological data is greatly enhanced by existing or emerging databases. Most existing databases, with few exceptions are not designed to easily support ...
S. A. Kirov, X. Peng, E. Baker, D. Schmoyer, B. Zh...
CIDR
2003
123views Algorithms» more  CIDR 2003»
13 years 9 months ago
Managing Expressions as Data in Relational Database Systems
A wide-range of applications, including Publish/Subscribe, Workflow, and Web-site Personalization, require maintaining user’s interest in expected data as conditional expression...
Aravind Yalamanchi, Jagannathan Srinivasan, Dieter...