KDD 2005 - PDF Preprint Papers

KDD 2005 International Conference on Knowledge Discovery and Data Mining

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed KDD-2005 Paper

click to vote

KDD
2005
ACM

222views Data Mining» more KDD 2005»

Dynamic syslog mining for network failure monitoring

14 years 5 months ago

Download www.cs.uiuc.edu

Kenji Yamanishi, Yuko Maruyama

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	222	Dynamic syslog mining for network failure monitoring	claim
2	218	A maximum entropy web recommendation system: combining collaborative and content features	claim
3	205	Feature bagging for outlier detection	claim
4	194	Web object indexing using domain knowledge	claim
5	193	An approach to spacecraft anomaly detection problem using kernel feature space	claim
6	192	Modeling and predicting personal information dissemination behavior	claim
7	185	Mining comparable bilingual text corpora for cross-language information integration	claim
8	182	Making holistic schema matching robust: an ensemble approach	claim
9	181	Evaluating similarity measures: a large-scale study in the orkut social network	claim
10	180	Information retrieval based on collaborative filtering with latent interest semantic map	claim
11	178	Failure detection and localization in component based systems by online tracking	claim
12	177	Query chains: learning to rank from implicit feedback	claim
13	177	Combining partitions by probabilistic label aggregation	claim
14	171	Deriving marketing intelligence from online discussion	claim
15	171	Application of kernels to link analysis	claim
16	170	Parallel mining of closed sequential patterns	claim
17	169	Analysis and Detection of Segment-Focused Attacks Against Collaborative Recommendation	claim
18	168	Nomograms for visualizing support vector machines	claim
19	166	A general model for clustering binary data	claim
20	166	Creating social networks to improve peer-to-peer networking	claim
21	165	Co-clustering by block value decomposition	claim
22	163	Data Sparsity Issues in the Collaborative Filtering Framework	claim
23	163	Web mining from competitors' websites	claim
24	162	Discovering frequent topological structures from graph datasets	claim
25	161	Combining email models for false positive reduction	claim
26	160	Consistent bipartite graph co-partitioning for star-structured high-order heterogeneous data co-clustering	claim
27	160	Optimizing time series discretization for knowledge discovery	claim
28	158	Adversarial learning	claim
29	157	A fast kernel-based multilevel algorithm for graph clustering	claim
30	153	Using retrieval measures to assess similarity in mining dynamic web clickstreams	claim
31	153	Improving discriminative sequential learning with rare--but--important associations	claim
32	151	Discovering evolutionary theme patterns from text: an exploration of temporal text mining	claim
33	149	A distributed learning framework for heterogeneous data sources	claim
34	147	Combining proactive and reactive predictions for data streams	claim
35	146	Anonymity-preserving data collection	claim
36	145	Streaming feature selection using alpha-investing	claim
37	145	Using and Learning Semantics in Frequent Subgraph Mining	claim
38	143	SVM selective sampling for ranking with application to data retrieval	claim
39	142	Towards exploratory test instance specific algorithms for high dimensional classification	claim
40	141	Fast window correlations over uncooperative time series	claim
41	140	Graphs over time: densification laws, shrinking diameters and possible explanations	claim
42	139	Reasoning about sets using redescription mining	claim
43	139	Learning to predict train wheel failures	claim
44	137	Pattern-based similarity search for microarray data	claim
45	137	A generalized framework for mining spatio-temporal patterns in scientific data	claim
46	135	A hybrid unsupervised approach for document clustering	claim
47	130	Simple and effective visual models for gene expression cancer diagnostics	claim
48	130	Regression error characteristic surfaces	claim
49	127	Detection of emerging space-time clusters	claim
50	127	Mining closed relational graphs with connectivity constraints	claim
51	125	Email data cleaning	claim
52	125	Price prediction and insurance for online auctions	claim
53	124	Scalable discovery of hidden emails from large folders	claim
54	124	A multinomial clustering model for fast simulation of computer architecture designs	claim
55	124	CLICKS: an effective algorithm for mining subspace clusters in categorical datasets	claim
56	123	Dimension induced clustering	claim
57	123	Automated detection of frontal systems from numerical model-generated data	claim
58	122	Pattern lattice traversal by selective jumps	claim
59	119	LIPED: HMM-based life profiles for adaptive event detection	claim
60	118	The predictive power of online chatter	claim
61	118	Generation of synthetic data sets for evaluating the accuracy of knowledge discovery systems	claim
62	118	On the use of linear programming for unsupervised text classification	claim
63	117	Rule extraction from linear support vector machines	claim
64	112	Model-based overlapping clustering	claim
65	112	Data mining in the chemical industry	claim
66	111	Finding partial orders from unordered 0-1 data	claim
67	109	Formulating distance functions via the kernel trick	claim
68	109	A new scheme on privacy-preserving data classification	claim
69	109	Overcoming Incomplete User Models in Recommendation Systems Via an Ontology	claim
70	107	Predicting the product purchase patterns of corporate customers	claim
71	107	Cross-relational clustering with user's guidance	claim
72	106	Simultaneous optimization of complex mining tasks with a knowledgeable cache	claim
73	106	Enhancing the lift under budget constraints: an application in the mutual fund industry	claim
74	104	Mining tree queries in a graph	claim
75	104	A hit-miss model for duplicate detection in the WHO drug safety database	claim
76	103	Finding similar files in large document repositories	claim
77	103	Fast discovery of unexpected patterns in data, relative to a Bayesian network	claim
78	103	Robust boosting and its relation to bagging	claim
79	103	Key semantics extraction by dependency tree mining	claim
80	99	Determining an author's native language by mining a text for errors	claim
81	99	Disease progression modeling from historical clinical databases	claim
82	98	Mining images on semantics via statistical learning	claim
83	92	Summarizing itemset patterns: a profile-based approach	claim
84	91	On mining cross-graph quasi-cliques	claim
85	90	Variable latent semantic indexing	claim
86	89	Mining risk patterns in medical data	claim
87	86	Unweaving a web of documents	claim
88	86	Probabilistic workflow mining	claim
89	85	A multiple tree algorithm for the efficient association of asteroid observations	claim
90	80	Wavelet synopsis for data streams: minimizing non-euclidean error	claim
91	73	Using relational knowledge discovery to prevent securities fraud	claim
92	61	Short term performance forecasting in enterprise systems	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers