KDD 2010 - PDF Preprint Papers

KDD 2010 International Conference on Knowledge Discovery and Data Mining

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed KDD-2010 Paper

click to vote

KDD
2010
ACM

435views Data Mining» more KDD 2010»

Topic models with power-law using Pitman-Yor process

13 years 3 months ago

Download www.r.dl.itc.u-tokyo.ac.jp

One of the important approaches for Knowledge discovery and Data mining is to estimate unobserved variables because latent variables can indicate hidden and speciﬁc properties o...

Issei Sato, Hiroshi Nakagawa

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	435	Topic models with power-law using Pitman-Yor process	claim
2	327	Cold start link prediction	claim
3	326	Document clustering via dirichlet process mixture model with feature selection	claim
4	323	TIARA: a visual exploratory text analytic system	claim
5	318	DivRank: the interplay of prestige and diversity in information networks	claim
6	310	An integrated machine learning approach to stroke prediction	claim
7	304	Automatic malware categorization using cluster ensemble	claim
8	300	Mining top-k frequent items in a data stream with flexible sliding windows	claim
9	300	Using data mining techniques to address critical information exchange needs in disaster affected public-private networks	claim
10	293	BioSnowball: automated population of Wikis	claim
11	289	Exploitation and exploration in a performance based contextual advertising system	claim
12	287	Compressed fisher linear discriminant analysis: classification of randomly projected data	claim
13	287	Designing efficient cascaded classifiers: tradeoff between accuracy and cost	claim
14	286	Nonnegative shared subspace learning and its application to social media retrieval	claim
15	282	Optimizing debt collections using constrained reinforcement learning	claim
16	279	Unifying dependent clustering and disparate clustering for non-homogeneous data	claim
17	277	Growing a tree in the forest: constructing folksonomies by integrating structured metadata	claim
18	275	Combined regression and ranking	claim
19	274	Grafting-light: fast, incremental feature selection and structure learning of Markov random fields	claim
20	272	Beyond heuristics: learning to classify vulnerabilities and predict exploits	claim
21	272	Scalable similarity search with optimized kernel hashing	claim
22	271	Parallel SimRank computation on large graphs with iterative aggregation	claim
23	270	An energy-efficient mobile recommender system	claim
24	268	Data mining to predict and prevent errors in health insurance claims processing	claim
25	265	Combining predictions for accurate recommender systems	claim
26	265	Scalable influence maximization for prevalent viral marketing in large-scale social networks	claim
27	263	Social action tracking via noise tolerant time-varying factor graphs	claim
28	259	A probabilistic model for personalized tag prediction	claim
29	257	Multi-task learning for boosting with application to web search ranking	claim
30	253	Mining periodic behaviors for moving objects	claim
31	252	Fast query execution for retrieval models based on path-constrained random walks	claim
32	250	Modeling relational events via latent classes	claim
33	250	On community outliers and their efficient detection in information networks	claim
34	249	Semi-supervised sparse metric learning using alternating linearization optimization	claim
35	247	Active learning for biomedical citation screening	claim
36	247	Metric forensics: a multi-level approach for mining volatile graphs	claim
37	246	Latent aspect rating analysis on review text data: a rating regression approach	claim
38	245	Flexible constrained spectral clustering	claim
39	245	Learning incoherent sparse and low-rank patterns from multiple tasks	claim
40	244	Connecting the dots between news articles	claim
41	244	Finding effectors in social networks	claim
42	243	Data mining with differential privacy	claim
43	242	A scalable two-stage approach for a class of dimensionality reduction techniques	claim
44	240	Diagnosing memory leaks using graph mining on heap dumps	claim
45	235	The topic-perspective model for social tagging systems	claim
46	235	Mining advisor-advisee relationships from research publication networks	claim
47	235	Direct mining of discriminative patterns for classifying uncertain data	claim
48	235	New perspectives and methods in link prediction	claim
49	233	Evolutionary hierarchical dirichlet processes for multiple correlated time-varying corpora	claim
50	232	Discovering frequent patterns in sensitive data	claim
51	228	The new iris data: modular data generators	claim
52	228	Medical coding classification by leveraging inter-code relationships	claim
53	225	Boosting with structure information in the functional space: an application to graph classification	claim
54	224	Suggesting friends using the implicit social graph	claim
55	224	Ensemble pruning via individual contribution ordering	claim
56	224	Multi-label learning by exploiting label dependency	claim
57	223	Frequent regular itemset mining	claim
58	223	An efficient algorithm for a class of fused lasso problems	claim
59	222	Large linear classification when data cannot fit in memory	claim
60	218	Online multiscale dynamic topic models	claim
61	217	Mining program workflow from interleaved traces	claim
62	215	On the quality of inferring interests from social neighbors	claim
63	214	Neighbor query friendly compression of social networks	claim
64	210	Temporal recommendation on graphs via long- and short-term preference fusion	claim
65	208	Towards mobility-based clustering	claim
66	207	Evaluating online ad campaigns in a pipeline: causal models at scale	claim
67	203	Collusion-resistant privacy-preserving data mining	claim
68	203	The community-search problem and how to plan a successful cocktail party	claim
69	199	Overlapping experiment infrastructure: more, better, faster experimentation	claim
70	199	Online discovery and maintenance of time series motifs	claim
71	197	Semi-supervised feature selection for graph classification	claim
72	195	Universal multi-dimensional scaling	claim
73	194	Versatile publishing for privacy preservation	claim
74	190	User browsing models: relevance versus examination	claim
75	188	Generative models for ticket resolution in expert networks	claim
76	188	Inferring networks of diffusion and influence	claim
77	188	Trust network inference for online rating data using generative models	claim
78	187	Fast nearest-neighbor search in disk-resident graphs	claim
79	186	Dynamics of conversations	claim
80	182	Extracting temporal signatures for comprehending systems biology models	claim
81	175	Learning with cost intervals	claim
82	161	Mass estimation and its applications	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers