| Data mining using fractals and power laws | p. 1 |
| Exploring the power of links in data mining | p. 2 |
| Community systems : the world online | p. 3 |
| A new DBMS architecture for DB-IR integration | p. 4 |
| Study on efficiency and effectiveness of KSORD | p. 6 |
| Discovering Web services based on probabilistic latent factor model | p. 18 |
| SCORE : symbiotic context oriented information retrieval | p. 30 |
| Process aware information systems : a human centered perspective | p. 39 |
| IMCS : incremental mining of closed sequential patterns | p. 50 |
| Mining time-shifting co-regulation patterns from gene expression data | p. 62 |
| Tight correlated item sets and their efficient discovery | p. 74 |
| Improved prediction of protein secondary structures using adaptively weighted profiles | p. 83 |
| Framework for building a high-quality Web page collection considering page group structure | p. 95 |
| Multi-document summarization using weighted similarity between topic and clustering-based non-negative semantic feature | p. 108 |
| A fair load balancing algorithm for hypercube-based DHT networks | p. 116 |
| LINP : supporting similarity search in unstructured peer-to-peer networks | p. 127 |
| Generation and matching of ontology data for the semantic Web in a peer-to-peer framework | p. 136 |
| Energy-efficient skyline queries over sensor network using mapped skyline filters | p. 144 |
| An adaptive dynamic cluster-based protocol for target tracking in wireless sensor networks | p. 157 |
| Distributed, hierarchical clustering and summarization in sensor networks | p. 168 |
| A new similarity measure for near duplicate video clip detection | p. 176 |
| Efficient algorithms for historical continuous kNN query processing over moving object trajectories | p. 188 |
| Effective density queries for moving objects in road networks | p. 200 |
| An efficient spatial search method based on SG-tree | p. 212 |
| Getting qualified answers for aggregate queries in spatio-temporal databases | p. 220 |
| Dynamic adaptation strategies for long-term and short-term user profile to personalize search | p. 228 |
| Using structured tokens to identify webpages for data extraction | p. 241 |
| Honto? : search : estimating trustworthiness of Web information by search results aggregation and temporal analysis | p. 253 |
| A probabilistic reasoning approach for discovering Web crawler sessions | p. 265 |
| An exhaustive and edge-removal algorithm to find cores in implicit communities | p. 273 |
| Active rules termination analysis through conditional formula containing updatable variable | p. 281 |
| Computing repairs for inconsistent XML document using chase | p. 293 |
| An XML publish/subscribe algorithm implemented by relational operators | p. 305 |
| Retrieving arbitrary XML fragments from structured peer-to-peer networks | p. 317 |
| Combining smooth graphs with semi-supervised learning | p. 329 |
| Extracting trend of time series based on improved empirical mode decomposition method | p. 341 |
| Spectral edit distance method for image clustering | p. 350 |
| Mining invisible tasks from event logs | p. 358 |
| The selection of tunable DBMS resources using the incremental/decremental relationship | p. 366 |
| Hyperclique pattern based off-topic detection | p. 374 |
| An energy efficient connected coverage protocol in wireless sensor networks | p. 382 |
| A clustered routing protocol with distributed intrusion detection for wireless sensor networks | p. 395 |
| Continuous approximate window queries in wireless sensor networks | p. 407 |
| A survey of job scheduling in grids | p. 419 |
| Relational nested optional join for efficient semantic Web query processing | p. 428 |
| Efficient processing of relational queries with sum constraints | p. 440 |
| A theoretical framework of natural computing - M good lattice points (GLP) method | p. 452 |
| Building data synopses within a known maximum error bound | p. 463 |
| Exploiting the structure of update fragments for efficient XML index maintenance | p. 471 |
| Improvements of HITS algorithms for spam links | p. 479 |
| Efficient keyword search over data-centric XML documents | p. 491 |
| Promotional ranking of search engine results : giving new Web pages a chance to prove their values | p. 503 |
| Adaptive scheduling strategy for data stream management system | p. 511 |
| A QoS-guaranteeing scheduling algorithm for continuous queries over streams | p. 522 |
| A simple but effective event-driven model for data stream queries | p. 534 |
| Efficient difference NN queries for moving objects | p. 542 |
| APCAS : an approximate approach to adaptively segment time series stream | p. 554 |
| Continuous k-nearest neighbor search under mobile environment | p. 566 |
| Record extraction based on user feedback and document selection | p. 574 |
| Density analysis of winnowing on non-uniform distributions | p. 586 |
| Error-based collaborative filtering algorithm for top-N recommendation | p. 594 |
| A PLSA-based approach for building user profile and implementing personalized recommendation | p. 606 |
| CoXML : a cooperative XML query answering system | p. 614 |
| Concept-based query transformation based on semantic centrality in semantic peer-to-peer environment | p. 622 |
| Mining infrequently-accessed file correlations in distributed file system | p. 630 |
| Learning-based trust model for optimization of selecting Web services | p. 642 |
| SeCED-FS : a new approach for the classification and discovery of significant regions in medical images | p. 650 |
| Context-aware search inside e-learning materials using textbook ontologies | p. 658 |
| Activate interaction relationships between students acceptance behavior and e-learning | p. 670 |
| Semantic-based grouping of search engine results using WordNet | p. 678 |
| Static Verification of Access Control Model for AXML Documents | p. 687 |
| SAM : an efficient algorithm for F&B-index construction | p. 697 |
| BUXMiner : an efficient bottom-up approach to mining XML query-patterns | p. 709 |
| A Web service architecture for bidirectional XML updating | p. 721 |
| ([alpha], k)-anonymity based privacy preservation by lossy join | p. 733 |
| Achieving k-anonymity via a density-based clustering method | p. 745 |
| k-anonymization without Q-S associations | p. 753 |
| Protecting and recovering database systems continuously | p. 765 |
| Towards Web services composition based on the mining and reasoning of their causal relationships | p. 777 |
| A dynamically adjustable rule engine for agile business computing environments | p. 785 |
| A formal design of Web community interactivity | p. 797 |
| Towards a type-2 fuzzy description logic for semantic search engine | p. 805 |
| A type-based analysis for verifying Web application | p. 813 |
| Homomorphism resolving of XPath trees based on automata | p. 821 |
| An efficient overlay multicast routing algorithm for real-time multimedia applications | p. 829 |
| Novel NonGaussianity measure based BSS algorithm for dependent signals | p. 837 |
| HiBO : mining Web's favorites | p. 845 |
| Frequent variable sets based clustering for artificial neural networks particle classification | p. 857 |
| Attributes reduction based on GA-CFS method | p. 868 |
| Towards high performance and high availability clusters of archived stream | p. 876 |
| Continuously matching episode rules for predicting future events over event streams | p. 884 |
| Table of Contents provided by Blackwell. All Rights Reserved. |
