Sciweavers

4435 search results - page 562 / 887
» Algorithms, games, and the internet
Sort
View
APWEB
2005
Springer
16 years 8 days ago
Labeling Scheme and Structural Joins for Graph-Structured XML Data
When XML documents are modeled as graphs, many challenging research issues arise. In particular, query processing for graphstructured XML data brings new challenges because traditi...
Hongzhi Wang, Wei Wang 0011, Xuemin Lin, Jianzhong...
168
Voted
SIGIR
2004
ACM
16 years 7 days ago
Subwebs for specialized search
We describe a method to define and use subwebs, user-defined neighborhoods of the Internet. Subwebs help improve search performance by inducing a topic-specific page relevance ...
Raman Chandrasekar, Harr Chen, Simon Corston-Olive...
PKDD
2004
Springer
168views Data Mining» more  PKDD 2004»
16 years 4 days ago
Combining Winnow and Orthogonal Sparse Bigrams for Incremental Spam Filtering
Spam filtering is a text categorization task that has attracted significant attention due to the increasingly huge amounts of junk email on the Internet. While current best-pract...
Christian Siefkes, Fidelis Assis, Shalendra Chhabr...
SEMWEB
2004
Springer
16 years 4 days ago
QOM - Quick Ontology Mapping
(Semi-)automatic mapping — also called (semi-)automatic alignment — of ontologies is a core task to achieve interoperability when two agents or services use different ontologie...
Marc Ehrig, Steffen Staab
ICDM
2002
IEEE
158views Data Mining» more  ICDM 2002»
15 years 11 months ago
Adaptive dimension reduction for clustering high dimensional data
It is well-known that for high dimensional data clustering, standard algorithms such as EM and the K-means are often trapped in local minimum. Many initialization methods were pro...
Chris H. Q. Ding, Xiaofeng He, Hongyuan Zha, Horst...