Sciweavers

1458 search results - page 70 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
PVLDB
2010
122views more  PVLDB 2010»
15 years 3 months ago
On Graph Query Optimization in Large Networks
The dramatic proliferation of sophisticated networks has resulted in a growing need for supporting effective querying and mining methods over such large-scale graph-structured da...
Peixiang Zhao, Jiawei Han
178
Voted
JCIT
2010
149views more  JCIT 2010»
14 years 11 months ago
People Summarization by Combining Named Entity Recognition and Relation Extraction
The two most important tasks in entity information summarization from the Web are named entity recognition and relation extraction. Little work has been done toward an integrated ...
Xiaojiang Liu, Nenghai Yu
DAWAK
2005
Springer
15 years 10 months ago
Processing Sequential Patterns in Relational Databases
Database integration of data mining has gained popularity and its significance is well recognized. However, the performance of SQL based data mining is known to fall behind specia...
Xuequn Shang, Kai-Uwe Sattler
ICAC
2009
IEEE
15 years 11 months ago
Ranking the importance of alerts for problem determination in large computer systems
The complexity of large computer systems has raised unprecedented challenges for system management. In practice, operators often collect large volume of monitoring data from system...
Guofei Jiang, Haifeng Chen, Kenji Yoshihira, Akhil...
EDBT
2006
ACM
174views Database» more  EDBT 2006»
16 years 5 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...