KDD 2009 - PDF Preprint Papers

KDD 2009 International Conference on Knowledge Discovery and Data Mining

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed KDD-2009 Paper

click to vote

KDD
2009
ACM

385views Data Mining» more KDD 2009»

Fast approximate spectral clustering

2 years 2 months ago

Download www2.berkeley.intel-research.net

Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...

Donghui Yan, Ling Huang, Michael I. Jordan

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.

Id	Views	Title	Status
1	385	Fast approximate spectral clustering	claim
2	174	Causality quantification and its applications: structuring and modeling of multivariate time series	claim
3	163	Network anomaly detection based on Eigen equation compression	claim
4	161	MetaFac: community discovery via relational hypergraph factorization	claim
5	153	Frequent pattern mining with uncertain data	claim
6	136	Anonymizing healthcare data: a case study on the blood transfusion service	claim
7	99	OpinionMiner: a novel machine learning system for web opinion mining and extraction	claim
8	97	Argo: intelligent advertising by mining a user's interest from his photo collections	claim
9	96	Tell me something I don't know: randomization strategies for iterative data mining	claim
10	95	Exploiting Wikipedia as external knowledge for document clustering	claim
11	92	Grocery shopping recommendations based on basket-sensitive random walk	claim
12	89	A generalized Co-HITS algorithm and its application to bipartite graphs	claim
13	87	Relational learning via latent social dimensions	claim
14	82	FpViz: a visualizer for frequent pattern mining	claim
15	82	Sentiment analysis of blogs by combining lexical knowledge with text classification	claim
16	80	Extracting discriminative concepts for domain adaptation in text mining	claim
17	79	DynaMMo: mining and summarization of coevolving sequences with missing values	claim
18	79	Scalable graph clustering using stochastic flows: applications to community discovery	claim
19	78	Regression-based latent factor models	claim
20	77	An association analysis approach to biclustering	claim
21	77	Enabling analysts in managed services for CRM analytics	claim
22	76	DOULION: counting triangles in massive graphs with a coin	claim
23	76	Drosophila gene expression pattern annotation using sparse features and term-term interactions	claim
24	74	Collective annotation of Wikipedia entities in web text	claim
25	70	Mind the gaps: weighting the unknown in large-scale one-class collaborative filtering	claim
26	70	Time series shapelets: a new primitive for data mining	claim
27	69	A principled and flexible framework for finding alternative clusterings	claim
28	69	Migration motif: a spatial - temporal pattern mining approach for financial markets	claim
29	69	Finding a team of experts in social networks	claim
30	68	Analyzing patterns of user content generation in online social networks	claim
31	67	Modeling and predicting user behavior in sponsored search	claim
32	66	Visual analysis of documents with semantic graphs	claim
33	66	Efficient anomaly monitoring over moving object trajectory streams	claim
34	66	Using graph-based metrics with empirical risk minimization to speed up active learning on networked data	claim
35	66	Mining rich session context to improve web search	claim
36	65	Thumbs-Up: a game for playing to rank search results	claim
37	65	Scalable pseudo-likelihood estimation in hybrid random fields	claim
38	65	User grouping behavior in online forums	claim
39	64	Picture this: preferences for image search	claim
40	64	PSkip: estimating relevance ranking quality from web search clickthrough data	claim
41	63	Mining for the most certain predictions from dyadic data	claim
42	63	Issues in evaluation of stream learning algorithms	claim
43	62	Beyond blacklists: learning to detect malicious web sites from suspicious URLs	claim
44	61	Identifying graphs from noisy and incomplete data	claim
45	61	Multi-way set enumeration in real-valued tensors	claim
46	61	Efficiently learning the accuracy of labeling sources for selective sampling	claim
47	61	A reputation system for selling human computation	claim
48	60	Improving classification accuracy using automatically extracted training data	claim
49	60	Ranking-based clustering of heterogeneous information networks with star network schema	claim
50	60	Characterizing individual communication patterns	claim
51	60	Pervasive parallelism in data mining: dataflow solution to co-clustering large and sparse Netflix data	claim
52	59	Handling outliers and concept drift in online mass flow prediction in CFB boilers	claim
53	59	The role of game theory in human computation systems	claim
54	59	Name-ethnicity classification from open sources	claim
55	59	Measuring the effects of preprocessing decisions and network forces in dynamic network analysis	claim
56	59	Correlated itemset mining in ROC space: a constraint programming approach	claim
57	58	Social influence analysis in large-scale networks	claim
58	57	Learning optimal ranking with tensor factorization for tag recommendation	claim
59	57	Exploring social tagging graph for web object classification	claim
60	57	On compressing social networks	claim
61	57	Mining discrete patterns via binary matrix factorization	claim
62	57	Probabilistic frequent itemset mining in uncertain databases	claim
63	56	Classification of software behaviors for failure detection: a discriminative pattern mining approach	claim
64	56	Intelligent file scoring system for malware detection from the gray list	claim
65	55	Inferring local synonyms for improving keyword suggestion in an on-line advertisement system	claim
66	55	Cross domain distribution adaptation via kernel mapping	claim
67	55	Co-evolution of social and affiliation networks	claim
68	55	Applying syntactic similarity algorithms for enterprise information management	claim
69	54	SNARE: a link analytic system for graph labeling and risk detection	claim
70	54	Entity discovery and assignment for opinion mining applications	claim
71	54	Probabilistic latent semantic user segmentation for behavioral targeted advertising	claim
72	53	On formal models for social verification	claim
73	53	Primal sparse Max-margin Markov networks	claim
74	53	Financial incentives and the "performance of crowds"	claim
75	53	Hierarchical difference scatterplots interactive visual analysis of data cubes	claim
76	53	Turning down the noise in the blogosphere	claim
77	53	Heterogeneous source consensus learning via decision propagation and negotiation	claim
78	52	Towards combining web classification and web information extraction: a case study	claim
79	52	Collaborative filtering with temporal dynamics	claim
80	52	New ensemble methods for evolving data streams	claim
81	52	Malware detection using statistical analysis of byte-level file content	claim
82	52	Grouped graphical Granger modeling methods for temporal causal modeling	claim
83	52	COA: finding novel patents through text analysis	claim
84	51	Accuracy of distance metric learning algorithms	claim
85	51	Query result clustering for object-level search	claim
86	50	WhereNext: a location predictor on trajectory pattern mining	claim
87	50	Learning from data with uncertain labels by boosting credal classifiers	claim
88	50	An exploration of climate data using complex networks	claim
89	50	Visual exploration of categorical and mixed data sets	claim
90	50	CP-summary: a concise representation for browsing frequent itemsets	claim
91	50	OLAP on search logs: an infrastructure supporting data-driven applications in search engines	claim
92	49	BGP-lens: patterns and anomalies in internet routing updates	claim
93	49	KissKissBan: a competitive human computation game for image annotation	claim
94	49	Scalable clustering and keyword suggestion for online advertisements	claim
95	49	Large human communication networks: patterns and a utility-driven generator	claim
96	49	Large-scale sparse logistic regression	claim
97	49	Quantification and semi-supervised classification methods for handling changes in class distribution	claim
98	49	Mining brain region connectivity for alzheimer's disease study via sparse inverse covariance estimation	claim
99	49	A multi-relational approach to spatial classification	claim
100	48	Algebraic visual analysis: the Catalano phone call data set case study	claim
101	48	Ad quality on TV: predicting television audience retention	claim
102	48	BBM: bayesian browsing model from petabyte-scale data	claim
103	48	Efficient methods for topic model inference on streaming document collections	claim
104	47	TANGENT: a novel, 'Surprise me', recommendation algorithm	claim
105	47	Constrained optimization for validation-guided conditional random field learning	claim
106	47	Augmenting the generalized hough transform to enable the mining of petroglyphs	claim
107	47	Address standardization with latent semantic association	claim
108	47	Improving data mining utility with projective sampling	claim
109	47	Exploiting contexts to deal with uncertainty in classification	claim
110	47	Improving clustering stability with combinatorial MRFs	claim
111	46	Meme-tracking and the dynamics of the news cycle	claim
112	46	Constant-factor approximation algorithms for identifying dynamic communities	claim
113	46	The offset tree for learning with partial labels	claim
114	45	Audience selection for on-line brand advertising: privacy-friendly social network targeting	claim
115	45	Genre-based decomposition of email class noise	claim
116	45	Adapting the right measures for K-means clustering	claim
117	45	Regret-based online ranking for a growing digital library	claim
118	45	Named entity mining from click-through data using weakly supervised latent dirichlet allocation	claim
119	45	Connections between the lines: augmenting social networks with text	claim
120	45	Information theoretic regularization for semi-supervised boosting	claim
121	45	Seven pitfalls to avoid when running controlled experiments on the web	claim
122	45	Collusion-resistant anonymous data collection method	claim
123	44	A case study of behavior-driven conjoint analysis on Yahoo!: front page today module	claim
124	44	Category detection using hierarchical mean shift	claim
125	44	From active towards InterActive learning: using consideration information to improve labeling correctness	claim
126	44	Interactive spatio-temporal cluster analysis of VAST challenge 2008 datasets	claim
127	44	Structured correspondence topic models for mining captioned figures in biological literature	claim
128	44	Effective multi-label active learning for text classification	claim
129	44	Efficient influence maximization in social networks	claim
130	44	TagCaptcha: annotating images with CAPTCHAs	claim
131	43	Mining in a mobile environment	claim
132	43	Online allocation of display advertisements subject to advanced sales contracts	claim
133	43	On the tradeoff between privacy and utility in data publishing	claim
134	43	Predicting bounce rates in sponsored search advertisements	claim
135	43	TrustWalker: a random walk model for combining trust-based and item-based recommendation	claim
136	43	Parallel community detection on large networks with propinquity dynamics	claim
137	42	Spatial-temporal causal modeling for climate change attribution	claim
138	42	Surveying the complementary role of automatic data analysis and visualization in knowledge discovery	claim
139	42	Consensus group stable feature selection	claim
140	42	Sustainable operation and management of data center chillers using temporal data mining	claim
141	42	Pricing guidance in ad sale negotiations: the PrintAds example	claim
142	41	Cartesian contour: a concise representation for a collection of frequent sets	claim
143	41	Anomalous window discovery through scan statistics for linear intersecting paths (SSLIP)	claim
144	41	Large-scale behavioral targeting	claim
145	41	Mining broad latent query aspects from search sessions	claim
146	41	Feature shaping for linear SVM classifiers	claim
147	41	Catching the drift: learning broad matches from clickthrough data	claim
148	41	Learning patterns in the dynamics of biological networks	claim
149	40	Combining link and content for community detection: a discriminative approach	claim
150	40	Optimizing web traffic via the media scheduling problem	claim
151	40	Learning dynamic temporal graphs for oil-production equipment monitoring system	claim
152	40	Decision support and profit prediction for online auction sellers	claim
153	40	Multi-class protein fold recognition using large margin logic based divide and conquer learning	claim
154	39	CoCo: coding cost for parameter-free outlier detection	claim
155	39	Clustering event logs using iterative partitioning	claim
156	39	A viewpoint-based approach for interaction graph analysis	claim
157	37	CAPTCHA-based image labeling on the Soylent Grid	claim
158	37	Multi-focal learning and its application to customer service support	claim
159	37	Large-scale graph mining using backbone refinement classes	claim
160	37	Characteristic relational patterns	claim
161	37	Toward autonomic grids: analyzing the job flow with affinity streaming	claim
162	34	Mining social networks for personalized email prioritization	claim
163	34	A LRT framework for fast spatial anomaly detection	claim
164	32	On burstiness-aware search for document sequences	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers