Sciweavers

1314 search results - page 209 / 263
» Approximate data mining in very large relational data
Sort
View
KDD
1997
ACM
169views Data Mining» more  KDD 1997»
15 years 8 months ago
Learning to Extract Text-Based Information from the World Wide Web
Thereis a wealthof informationto be minedfromnarrative text on the WorldWideWeb.Unfortunately, standard natural language processing (NLP)extraction techniques expect full, grammat...
Stephen Soderland
WWW
2007
ACM
16 years 5 months ago
Detectives: detecting coalition hit inflation attacks in advertising networks streams
Click fraud is jeopardizing the industry of Internet advertising. Internet advertising is crucial for the thriving of the entire Internet, since it allows producers to advertise t...
Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi
CORR
2012
Springer
225views Education» more  CORR 2012»
14 years 2 days ago
The Filter-Placement Problem and its Application to Minimizing Information Multiplicity
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
Dóra Erdös, Vatche Ishakian, Andrei La...
BMCBI
2005
101views more  BMCBI 2005»
15 years 4 months ago
MASQOT: a method for cDNA microarray spot quality control
Background: cDNA microarray technology has emerged as a major player in the parallel detection of biomolecules, but still suffers from fundamental technical problems. Identifying ...
Max Bylesjö, Daniel Eriksson, Andreas Sjö...
ICDE
2009
IEEE
156views Database» more  ICDE 2009»
16 years 6 months ago
Distributed Structural Relaxation of XPath Queries
Due to the structural heterogeneity of XML, queries are often interpreted approximately. This is achieved by relaxing the query and ranking the results based on their relevance to ...
Georgia Koloniari, Evaggelia Pitoura