CIKM 2009 - PDF Preprint Papers

CIKM 2009 Conference on Information and Knowledge Management

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CIKM-2009 Paper

click to vote

CIKM
2009
Springer

406views Information Technology» more CIKM 2009»

LoOP: local outlier probabilities

13 years 11 months ago

Download www.dbs.informatik.uni-muenchen.de

Many outlier detection methods do not merely provide the decision for a single data object being or not being an outlier but give also an outlier score or “outlier factor” sig...

Hans-Peter Kriegel, Peer Kröger, Erich Schube...

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	406	LoOP: local outlier probabilities	claim
2	369	Scalable learning of collective behavior based on sparse social dimensions	claim
3	281	P-Rank: a comprehensive structural similarity measure over information networks	claim
4	273	Evaluating top-k queries over incomplete data streams	claim
5	256	A novel approach for privacy mining of generic basic association rules	claim
6	243	User interests in social media sites: an exploration with micro-blogs	claim
7	235	SPIDER: a system for scalable, parallel / distributed evaluation of large-scale RDF data	claim
8	234	Personalization as a service: the architecture and a case study	claim
9	231	Efficient itemset generator discovery over a stream sliding window	claim
10	226	Improving web page classification by label-propagation over click graphs	claim
11	217	Probabilistic models for topic learning from images and captions in online biomedical literatures	claim
12	216	Automatic link detection: a sequence labeling approach	claim
13	216	Analyzing and evaluating query reformulation strategies in web search logs
14	213	Identifying comparable entities on the web	claim
15	209	A case study on model driven data integration for data centric software development	claim
16	208	Cross-language linking of news stories on the web using interlingual topic modelling	claim
17	207	Semi-supervised learning of semantic classes for query understanding: from the web and for the web	claim
18	207	Joint sentiment/topic model for sentiment analysis	claim
19	205	Event detection from flickr data through wavelet-based spatial analysis	claim
20	202	A social recommendation framework based on multi-scale continuous conditional random fields	claim
21	202	iMecho: an associative memory based desktop search system	claim
22	200	Learning to rank graphs for online similar graph search	claim
23	200	Frequent subgraph pattern mining on uncertain graph data	claim
24	200	L2 norm regularized feature kernel regression for graph data	claim
25	200	Query processing of massive trajectory data based on mapreduce	claim
26	197	Applying differential privacy to search queries in a policy based interactive framework	claim
27	195	Answering XML queries using materialized views revisited	claim
28	194	Heterogeneous cross domain ranking in latent space	claim
29	193	Context sensitive synonym discovery for web search queries	claim
30	192	Evaluation of methods for relative comparison of retrieval systems based on clickthroughs	claim
31	192	Combining labeled and unlabeled data with word-class distribution learning	claim
32	191	Bitmap indexes for relational XML twig query processing	claim
33	191	Walking in the crowd: anonymizing trajectory data for pattern analysis	claim
34	191	Mining data streams with periodically changing distributions	claim
35	190	Fast shortest path distance estimation in large networks	claim
36	190	Building domain-oriented sentiment lexicon by improved information bottleneck	claim
37	189	Classification-based resource selection	claim
38	188	Learning to rank from Bayesian decision inference	claim
39	188	Multivariate classification of urine metabolome profiles for breast cancer diagnosis	claim
40	187	A query language for analyzing networks	claim
41	187	A mobile tourist assistance and recommendation system based on complex networks	claim
42	186	Compressing tags to find interesting media groups	claim
43	185	MagicCube: choosing the best snippet for each aspect of an entity	claim
44	185	Adaptive relevance feedback in information retrieval	claim
45	183	Completing wikipedia's hyperlink structure through dimensionality reduction	claim
46	183	Linear predictive coding representation of correlated mutation for protein sequence alignment	claim
47	182	Graph classification based on pattern co-occurrence	claim
48	182	Density-based clustering using graphics processors	claim
49	181	Annotating wikipedia articles with semantic tags for structured retrieval	claim
50	180	Group-by skyline query processing in relational engines	claim
51	180	Packing the most onto your cloud	claim
52	179	StereoTrust: a group based personalized trust model	claim
53	179	Independent informative subgraph mining for graph information retrieval	claim
54	179	Interactive, topic-based visual text summarization and analysis	claim
55	178	Detecting topic evolution in scientific literature: how can citations help?	claim
56	177	Incremental query evaluation for support vector machines	claim
57	177	Blogger-centric contextual advertising	claim
58	176	Topic and keyword re-ranking for LDA-based topic modeling	claim
59	176	A signal-to-noise approach to score normalization	claim
60	176	Privacy-enhanced public view for social graphs	claim
61	175	On domain similarity and effectiveness of adapting-to-rank	claim
62	175	Exploring relevance for clicks	claim
63	174	Group CRM: a new telecom CRM framework from social network perspective	claim
64	171	Networks, communities and kronecker products	claim
65	171	Effective, design-independent XML keyword search	claim
66	170	A general magnitude-preserving boosting algorithm for search ranking	claim
67	170	Automobile, car and BMW: horizontal and hierarchical approach in social tagging systems	claim
68	169	Scalable continuous range monitoring of moving objects in symbolic indoor space	claim
69	167	Progressive skyline query evaluation and maintenance in wireless sensor networks	claim
70	167	Probabilistic skyline queries	claim
71	166	Potential collaboration discovery using document clustering and community structure detection	claim
72	166	A co-classification framework for detecting web spam and spammers in social media web sites	claim
73	165	An empirical study on using hidden markov model for search interface segmentation	claim
74	165	Generating SQL/XML query and update statements	claim
75	163	The impact of document structure on keyphrase extraction	claim
76	162	Workload-aware trie indices for XML	claim
77	162	Learning from past queries for resource selection	claim
78	160	Inverted indexes vs. bitmap indexes in decision support systems	claim
79	160	Automatic retrieval of similar content using search engine query interface	claim
80	160	Towards a universal wordnet by learning from combined evidence	claim
81	160	Enabling multi-level relevance feedback on pubmed by integrating rank learning into DBMS	claim
82	160	Improving binary classification on text problems using differential word features	claim
83	159	Fast and effective histogram construction	claim
84	159	Using domain ontology for semantic web usage mining and next page prediction	claim
85	159	Dynamic in-page logging for flash-aware B-tree index	claim
86	159	TSA'09 workshop summary: topic-sentiment analysis	claim
87	158	Automatic generation of topic pages using query-based aspect models	claim
88	158	Effective and efficient structured retrieval	claim
89	158	Hydra: a hybrid recommender system [cross-linked rating and content information]	claim
90	157	Terminology mining in social media	claim
91	157	Retrieval experiments using pseudo-desktop collections	claim
92	156	Scalable indexing of RDF graphs for efficient join processing	claim
93	155	Semi-nonnegative matrix factorization with global statistical consistency for collaborative filtering	claim
94	155	Characterizing and predicting search engine switching behavior	claim
95	154	Graph-based transfer learning	claim
96	154	Improvements that don't add up: ad-hoc retrieval results since 1998	claim
97	154	Empirical justification of the gain and discount function for nDCG	claim
98	153	Reducing the risk of query expansion via robust constrained optimization	claim
99	153	MKEM: a multi-level knowledge emergence model for mining undiscovered public knowledge	claim
100	153	Multidimensional political spectrum identification and analysis	claim
101	153	Improving search engines using human computation games	claim
102	152	Translating relevance scores to probabilities for contextual advertising	claim
103	152	Tree-pattern-based duplicate code detection	claim
104	152	On optimising personal network size to manage information flow	claim
105	151	Voting in social networks	claim
106	151	MRM: an adaptive framework for XML searching	claim
107	151	Beyond hyperlinks: organizing information footprints in search logs to support effective browsing	claim
108	151	An analysis of information diffusion in the blog world	claim
109	150	Mining tourist information from user-supplied collections	claim
110	150	Fast centrality approximation in modular networks	claim
111	149	Measuring system performance and topic discernment using generalized adaptive-weight mean	claim
112	148	Improving retrievability of patents with cluster-based pseudo-relevance feedback documents selection	claim
113	147	A comparative study of methods for estimating query language models with pseudo feedback	claim
114	147	Blog cascade affinity: analysis and prediction	claim
115	147	A framework for semantic link discovery over relational data	claim
116	147	OfCourse: web content discovery, classification and information extraction for online course materials	claim
117	146	Maximal metric margin partitioning for similarity search indexes	claim
118	146	Online anonymity for personalized web services	claim
119	145	Space-economical partial gram indices for exact substring matching	claim
120	144	Enhancing expertise retrieval using community-aware strategies	claim
121	144	Generating comparative summaries of contradictory opinions in text	claim
122	144	Utilizing inter-passage and inter-document similarities for re-ranking search results	claim
123	144	A tag recommendation system for folksonomy	claim
124	143	Language-model-based ranking for queries on RDF-graphs	claim
125	143	The effect of negation on sentiment analysis and retrieval effectiveness	claim
126	143	Context-sensitive document ranking	claim
127	143	Robust record linkage blocking using suffix arrays	claim
128	142	Text summarization model based on the budgeted median problem	claim
129	142	Using multiple ontologies in information extraction	claim
130	142	Mining frequent itemsets in time-varying data streams	claim
131	142	A framework for safely publishing communication traces	claim
132	141	Similarity-aware indexing for real-time entity resolution	claim
133	141	Rank-aware clustering of structured datasets	claim
134	141	ASIC: algebra-based structural index comparison	claim
135	141	RS-Wrapper: random write optimization for solid state drive	claim
136	141	Efficient processing of group-oriented connection queries in a large graph	claim
137	140	Large margin transductive transfer learning	claim
138	140	Easiest-first search: towards comprehension-based web search	claim
139	140	Compact full-text indexing of versioned document collections	claim
140	139	On the feasibility of multi-site web search engines	claim
141	139	Location cache for web queries	claim
142	139	Collaborative filtering using random neighbours in peer-to-peer networks	claim
143	139	Efficient feature weighting methods for ranking	claim
144	139	Semantic queries in databases: problems and challenges	claim
145	139	Learning to recommend questions based on user ratings	claim
146	138	MatchSim: a novel neighbor-based similarity measure with maximum neighborhood matching	claim
147	138	Finding good feedback documents	claim
148	138	Supporting context-based query in personal DataSpace	claim
149	138	A novel distributed P2P simulator architecture: D-P2P-sim	claim
150	137	Trust relationship prediction using online product review data	claim
151	136	An analysis framework for search sequences	claim
152	136	Dissemination of heterogeneous XML data in publish/subscibe systems	claim
153	136	Probabilistic models of ranking novel documents for faceted topic retrieval	claim
154	136	Interactive relevance feedback with graded relevance and sentence extraction: simulated user experiments	claim
155	135	Web search result summarization: title selection algorithms and user satisfaction	claim
156	135	PQC: personalized query classification	claim
157	134	Low-cost management of inverted files for online full-text search	claim
158	133	(Not) yet another matcher	claim
159	133	Personalized social search based on the user's social network	claim
160	133	Text segmentation via topic modeling: an analytical study	claim
161	133	Diverging patterns: discovering significant frequency change dissimilarities in large databases	claim
162	132	Helping editors choose better seed sets for entity set expansion	claim
163	132	Structure-aware indexing for keyword search in databases	claim
164	132	Leveraging a scalable row store to build a distributed text index	claim
165	132	Community mining on dynamic weighted directed graphs	claim
166	132	Minimal common container of tree patterns	claim
167	131	Exploiting bidirectional links: making spamming detection easier	claim
168	131	Post-rank reordering: resolving preference misalignments between search engines and end users	claim
169	131	Provenance query evaluation: what's so special about it?	claim
170	130	Multidimensional routing indices for efficient distributed query processing	claim
171	129	MING: mining informative entity relationship subgraphs	claim
172	129	A general markov framework for page importance computation	claim
173	128	What happens after an ad click?: quantifying the impact of landing pages in web advertising	claim
174	128	Learning better transliterations	claim
175	127	Vetting the links of the web	claim
176	127	Generating synopses for document-element search	claim
177	127	Commentary-based video categorization and concept discovery	claim
178	127	Suffix trees for very large genomic sequences	claim
179	127	Answer typing for information retrieval	claim
180	126	AS-index: a structure for string search using n-grams and algebraic signatures	claim
181	126	XQGen: an algebra-based XPath query generator for micro-benchmarking	claim
182	126	Self-organizing peer-to-peer networks for collaborative document tracking	claim
183	126	The influence of the document ranking in expert search	claim
184	125	POkA: identifying pareto-optimal k-anonymous nodes in a domain hierarchy lattice	claim
185	125	Pure spreading activation is pointless	claim
186	124	Feature selection for ranking using boosted trees	claim
187	124	Transaction synchronization protocol using XML in client-server environment	claim
188	122	Aging effects on query flow graphs for query suggestion	claim
189	122	YAM: a schema matcher factory	claim
190	122	Towards non-directional Xpath evaluation in a RDBMS	claim
191	122	Expected reciprocal rank for graded relevance	claim
192	121	A translation model for matching reviews to objects	claim
193	121	Graph-based seed selection for web-scale crawlers	claim
194	120	Identifying interesting assertions from the web	claim
195	119	A machine learning approach for improved BM25 retrieval	claim
196	119	Ensembles in adversarial classification for spam	claim
197	118	Unsupervised binning of environmental genomic fragments based on an error robust selection of l-mers	claim
198	118	What makes categories difficult to classify?: a study on predicting classification performance for categories	claim
199	117	Using opinion-based features to boost sentence retrieval	claim
200	116	A study of selective collection enrichment for enterprise search	claim
201	116	Efficient record-level wrapper induction	claim
202	115	Mining linguistic cues for query expansion: applications to drug interaction search	claim
203	115	iPoG: fast interactive proximity querying on graphs	claim
204	115	Data extraction from the web using wild card queries	claim
205	112	Fragment-based clustering ensembles	claim
206	112	Relying on topic subsets for system ranking estimation	claim
207	110	Agglomerating local patterns hierarchically with ALPHA	claim
208	110	User-induced links in collaborative tagging systems	claim
209	110	Identifying static analysis techniques for finding non-fix hunks in fix revisions	claim
210	109	Supervised semantic indexing	claim
211	108	A query model based on normalized log-likelihood	claim
212	107	Role of weak ties in link prediction of complex networks	claim
213	98	Predicting the volume of comments on online news stories	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers