CIKM 2006 - PDF Preprint Papers

CIKM 2006 Conference on Information and Knowledge Management

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CIKM-2006 Paper

click to vote

CIKM
2006
Springer

259views Information Technology» more CIKM 2006»

Constrained subspace skyline computation

13 years 8 months ago

Download dbs.mathematik.uni-marburg.de

In this paper we introduce the problem of Constrained Subspace Skyline Queries. This class of queries can be thought of as a generalization of subspace skyline queries using range...

Evangelos Dellis, Akrivi Vlachou, Ilya Vladimirski...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Related Conferences

Id	Views	Title	Status

1	259	Constrained subspace skyline computation	claim
2	207	Adaptive non-linear clustering in data streams	claim
3	202	Topic evolution and social interactions: how authors effect research	claim
4	195	Efficient join processing over uncertain data	claim
5	195	Processing relaxed skylines in PDMS using distributed data summaries	claim
6	189	Coupling feature selection and machine learning methods for navigational query identification	claim
7	186	A fast and robust method for web page template detection and removal	claim
8	183	An integer programming approach for frequent itemset hiding	claim
9	182	Voting for candidates: adapting data fusion techniques for an expert search task	claim
10	178	Eigen-trend: trend analysis in the blogosphere based on singular value decompositions	claim
11	177	Measuring the meaning in time series clustering of text search queries	claim
12	175	Structure-based querying of proteins using wavelets	claim
13	174	Evaluation by comparing result sets in context	claim
14	173	Privacy preserving sequential pattern mining in distributed databases	claim
15	171	Efficiently clustering transactional data with weighted coverage density	claim
16	167	Re-ranking search results using query logs	claim
17	165	Matching directories and OWL ontologies with AROMA	claim
18	163	Incorporating query difference for learning retrieval functions in world wide web search	claim
19	162	Amnesic online synopses for moving objects	claim
20	159	Representing documents with named entities for story link detection (SLD)	claim
21	158	A comparative study on classifying the functions of web page blocks	claim
22	156	Incremental hierarchical clustering of text documents	claim
23	152	Concept-based document readability in domain specific information retrieval	claim
24	150	Knowing a web page by the company it keeps	claim
25	149	Cache-oblivious nested-loop joins	claim
26	148	Multi-evidence, multi-criteria, lazy associative document classification	claim
27	147	Efficient range-constrained similarity search on wavelet synopses over multiple streams	claim
28	146	Summarizing local context to personalize global web search	claim
29	145	Information retrieval from relational databases using semantic queries	claim
30	145	Concept frequency distribution in biomedical text summarization	claim
31	144	Distributed spatio-temporal similarity search	claim
32	143	Improving novelty detection for general topics using sentence level information patterns	claim
33	142	k nearest neighbor classification across multiple private databases	claim
34	141	Movie review mining and summarization	claim
35	141	Resource-aware kernel density estimators over streaming data	claim
36	139	Estimating average precision with incomplete and imperfect judgments	claim
37	139	KDDCS: a load-balanced in-network data-centric storage scheme for sensor networks	claim
38	139	3DString: a feature string kernel for 3D object classification on voxelized data	claim
39	138	A document-centric approach to static index pruning in text retrieval systems	claim
40	135	Exploiting asymmetry in hierarchical topic extraction	claim
41	135	Heuristic containment check of partial tree-pattern queries in the presence of index graphs	claim
42	134	Mining coherent patterns from heterogeneous microarray data	claim
43	134	CP/CV: concept similarity mining without frequency information from domain describing taxonomies	claim
44	133	Mining blog stories using community-based and temporal clustering	claim
45	132	Mining compressed commodity workflows from massive RFID data sets	claim
46	132	Text classification improved through multigram models	claim
47	132	Continuous keyword search on multiple text streams	claim
48	130	Improving query translation with confidence estimation for cross language information retrieval	claim
49	129	A system for query-specific document summarization	claim
50	126	Matching and evaluation of disjunctive predicates for data stream sharing	claim
51	124	Approximate reverse k-nearest neighbor queries in general metric spaces	claim
52	123	On the structural properties of massive telecom call graphs: findings and implications	claim
53	122	Classification spanning correlated data streams	claim
54	121	Finding highly correlated pairs efficiently with powerful pruning	claim
55	121	The visual funding navigator: analysis of the NSF funding information	claim
56	120	A probabilistic relevance propagation model for hypertext retrieval	claim
57	119	A dictionary for approximate string search and longest prefix search	claim
58	118	TRIPS and TIDES: new algorithms for tree mining	claim
59	117	A data stream language and system designed for power and extensibility	claim
60	113	SaLSa: computing the skyline without scanning the whole sky	claim
61	112	Secure search in enterprise webs: tradeoffs in efficient implementation for document level security	claim
62	110	Performance thresholding in practical text classification	claim
63	110	Adapting association patterns for text categorization: weaknesses and enhancements	claim
64	109	Multi-task text segmentation and alignment based on weighted mutual information	claim
65	107	Efficient model selection for regularized linear discriminant analysis	claim
66	103	Describing differences between databases	claim
67	103	A combination of trie-trees and inverted files for the indexing of set-valued attributes	claim
68	102	Optimisation methods for ranking functions with multiple parameters	claim
69	102	Annotation propagation revisited for key preserving views	claim
70	102	PEPX: a query-friendly probabilistic XML database	claim
71	101	IR principles for content-based indexing and retrieval of functional brain images	claim
72	97	An approximate multi-word matching algorithm for robust document retrieval	claim
73	97	Investigating the exhaustivity dimension in content-oriented XML element retrieval evaluation	claim
74	96	Modeling performance-driven workload characterization of web search systems	claim
75	96	Ranking web objects from multiple communities	claim
76	95	Ranking robustness: a novel framework to predict query performance	claim
77	95	Combining feature selectors for text classification	claim
78	93	Estimating corpus size via queries	claim
79	91	Maximizing the sustained throughput of distributed continuous queries	claim
80	83	Direct comparison of commercial and academic retrieval system: an initial study	claim
81	83	Improving query I/O performance by permuting and refining block request sequences	claim
82	81	Efficient mining of max frequent patterns in a generalized environment	claim
83	80	Automatic computation of semantic proximity using taxonomic knowledge	claim
84	80	Validating associations in biological databases	claim
85	79	Effective and efficient classification on a search-engine model	claim
86	76	Designing semantics-preserving cluster representatives for scientific input conditions	claim
87	76	How I learned to stop worrying and love the imminent internet singularity	claim
88	76	Multi-query optimization of sliding window aggregates by schedule synchronization	claim
89	76	A neighborhood-based approach for clustering of linked document collections	claim
90	69	Processing information intent via weak labeling	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers