default search action
Knowledge and Information Systems, Volume 16
Volume 16, Number 1, July 2008
- James Cheng, Yiping Ke, Wilfred Ng:
A survey on algorithms for mining frequent itemsets over data streams. 1-27 - Ira Assent, Ralph Krieger, Boris Glavic, Thomas Seidl:
Clustering multidimensional sequences in spatial and temporal databases. 29-51 - Jeffrey Chan, James Bailey, Christopher Leckie:
Discovering correlated spatio-temporal changes in evolving graphs. 53-96 - Cheng Luo, Zhewei Jiang, Wen-Chi Hou, Feng Yan, Qiang Zhu:
A relational model for XML structural joins and their size estimations. 97-127
Volume 16, Number 2, August 2008
- Aris Anagnostopoulos, Andrei Z. Broder, Kunal Punera:
Effective and efficient classification on a search-engine model. 129-154 - Yun Zhou, W. Bruce Croft:
Measuring ranked list robustness for query performance prediction. 155-171 - Emine Yilmaz, Javed A. Aslam:
Estimating average precision when judgments are incomplete. 173-211 - Yiping Ke, James Cheng, Wilfred Ng:
An information-theoretic approach to quantitative association rule mining. 213-244 - Xuan-Hong Dang, Wee Keong Ng, Kok-Leong Ong:
Online mining of frequent sets in data streams with error guarantee. 245-258
Volume 16, Number 3, September 2008
- Craig Macdonald, Iadh Ounis:
Voting techniques for expert search. 259-280 - Tao Peng, Wanli Zuo, Fengling He:
SVM based adaptive learning method for text classification from positive and unlabeled documents. 281-301 - Ramazan Savas Aygün:
S2S: structural-to-syntactic matching similar documents. 303-329 - M. Senthil Arumugam, M. V. C. Rao, Aarthi Chandramohan:
A new and improved version of particle swarm optimization algorithm with global-local best parameters. 331-357 - Soon M. Chung, Congnan Luo:
Efficient mining of maximal frequent itemsets from databases on a cluster of workstations. 359-391
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.