Sciweavers

1053 search results - page 71 / 211
» Improving the SLA Algorithm Using Association Rules
Sort
View
ADC
2003
Springer
182views Database» more  ADC 2003»
15 years 5 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
111
Voted
WWW
2008
ACM
16 years 1 months ago
Improving web spam detection with re-extracted features
Web spam detection has become one of the top challenges for the Internet search industry. Instead of using some heuristic rules, we propose a feature re-extraction strategy to opt...
Guanggang Geng, Chunheng Wang, Qiudan Li
BMCBI
2008
101views more  BMCBI 2008»
15 years 21 days ago
Reranking candidate gene models with cross-species comparison for improved gene prediction
Background: Most gene finders score candidate gene models with state-based methods, typically HMMs, by combining local properties (coding potential, splice donor and acceptor patt...
Qian Liu, Koby Crammer, Fernando C. N. Pereira, Da...
128
Voted
CIKM
2005
Springer
15 years 6 months ago
Maximal termsets as a query structuring mechanism
Search engines process queries conjunctively to restrict the size of the answer set. Further, it is not rare to observe a mismatch between the vocabulary used in the text of Web p...
Bruno Pôssas, Nivio Ziviani, Berthier A. Rib...
IADIS
2003
15 years 2 months ago
Pandora Case Tool: Triggers Generating for Cardinality Constraints in RDBMS
The cardinality constraint is one of the most important constraints that can be established in a conceptual model. Nevertheless, not all CASE tools for developing database support...
Harith T. Al-Jumaily, Dolores Cuadra, Paloma Mart&...