Advances in Data Mining - Theoretical Aspects and Applications: 7th Industrial Conference, ICDM 2007, Leipzig, Germany, July 14-18, 2007, ProceedingsPetra Perner Springer, 2007. gada 18. aug. - 356 lappuses ICDM / MLDM Medaillie (limited edition) Meissner Porcellan, the “White Gold” of King August the Strongest of Saxonia ICDM 2007 was the seventh event in the Industrial Conference on Data Mining series and was held in Leipzig (www.data-mining-forum.de). For this edition the Program Committee received 96 submissions from 24 countries (see Fig. 1). After the peer-review process, we accepted 25 high-quality papers for oral presentation that are included in this proceedings book. The topics range from aspects of classification and prediction, clustering, Web mining, data mining in medicine, applications of data mining, time series and frequent pattern mining, and association rule mining. Germany 9,30% 4,17% China 9,30% 1,04% 6,98% 3,13% South Korea Czech Republic 6,98% 3,13% USA 6,98% 2,08% 4,65% 2,08% UK Portugal 4,65% 2,08% Iran 4,65% 2,08% India 4,65% 2,08% Brazil 4,65% 1,04% Hungary 4,65% 1,04% Mexico 4,65% 1,04% Finland 2,33% 1,04% Ireland 2,33% 1,04% Slovenia 2,33% 1,04% France 2,33% 1,04% Israel 2,33% 1,04% Spain 2,33% 1,04% Greece 2,33% 1,04% Italy 2,33% 1,04% Sweden 2,33% 1,04% Netherlands 2,33% 1,04% Malaysia 2,33% 1,04% Turkey 2,33% 1,04% Fig. 1. Distribution of papers among countries Twelve papers were selected for poster presentations that are published in the ICDM Poster Proceedings Volume. |
No grāmatas satura
1.–5. rezultāts no 34.
6. lappuse
... solution). In order to establish such a case it suffices that the corresponding episode happened in the past. A case ... solution to an actual problem one looks for a similar problem in an experience base, takes the solution from the ...
... solution). In order to establish such a case it suffices that the corresponding episode happened in the past. A case ... solution to an actual problem one looks for a similar problem in an experience base, takes the solution from the ...
12. lappuse
... solution is adapted while in IR rather the query is rewritten (because one cannot rewrite a document). A widely used method is query expansion. Here the original query is supplemented with additional terms. The idea is to add such terms ...
... solution is adapted while in IR rather the query is rewritten (because one cannot rewrite a document). A widely used method is query expansion. Here the original query is supplemented with additional terms. The idea is to add such terms ...
13. lappuse
... solution to the problem finding an optimal method. One can formulate, however, some directions. For this purpose we introduced levels for contexts. On the general level, existing search machines are superior. The group level occurs ...
... solution to the problem finding an optimal method. One can formulate, however, some directions. For this purpose we introduced levels for contexts. On the general level, existing search machines are superior. The group level occurs ...
22. lappuse
... solutions, taking the data properties, the user's needs and any other prior knowledge into account. In this paper we ... solution to the problems underlying the CBR methodology. Our scheme is different form existing work [7]-[10] on ...
... solutions, taking the data properties, the user's needs and any other prior knowledge into account. In this paper we ... solution to the problems underlying the CBR methodology. Our scheme is different form existing work [7]-[10] on ...
24. lappuse
... solution associated with the closest case is given as output, and the event is stored in the case base, based on the case-selective case-registration procedure. This procedure ensures that the off-line learnt classes can be handled for ...
... solution associated with the closest case is given as output, and the event is stored in the case base, based on the case-selective case-registration procedure. This procedure ensures that the off-line learnt classes can be handled for ...
Saturs
1 | |
15 | |
21 | |
An Efficient Algorithm for InstanceBased Learning on Data Streams | 34 |
Softening the Margin in Discrete SVM | 49 |
A New Method and Comparative Study in the Application of Face Recognition System | 63 |
Outlier Detection with Streaming Dyadic Decomposition | 77 |
VISRED Numerical Data Mining with Linear and Nonlinear Techniques | 92 |
A Case Study | 199 |
Combining Traditional and NeuralBased Techniques for Ink Feed Control in a Newspaper Printing Press | 214 |
A Case Study for Detection of Emotions in Speech | 228 |
Neural Business Control System | 242 |
A Framework for Discovering and Analyzing Changing Customer Segments | 255 |
Collaborative Filtering Using Electrical Resistance Network Models | 269 |
Visual Query and Exploration System for Temporal Relational Database | 283 |
Towards an Online ImageBased Tree Taxonomy | 296 |
Clustering by Random Projections | 107 |
Lightweight Clustering Technique for Distributed Data Mining Applications | 120 |
Statistical and RuleBased Approach | 135 |
Improved IR in Cohesion Model for Link Detection System | 148 |
Improving a StateoftheArt Named Entity Recognition System Using the World Wide Web | 163 |
A CaseBased Reasoning System to Explain Exceptional Dialysis Patients | 173 |
The Role of Prototypical Cases in Biomedical CaseBased Reasoning | 184 |
Distributed Generative Data Mining | 307 |
PrivacyPreserving Discovery of Frequent Patterns in Time Series | 318 |
Efficient Non Linear Time Series Prediction Using Non Linear Signal Analysis and Neural Networks in Chaotic Diode Resonator Circuits | 329 |
Using Disjunctions in Association Mining | 339 |
Author Index | 352 |
Citi izdevumi - Skatīt visu
Advances in Data Mining - Theoretical Aspects and Applications: 7th ... Petra Perner Priekšskatījums nav pieejams - 2009 |
Bieži izmantoti vārdi un frāzes
according accuracy active adaptation algorithm allows amount analysis applied approach associated attributes Case-Based classification clustering combination compared components Computer concept considered contains corresponding data mining data set database defined density described detection developed dimension distance distributed documents error evaluation event examples experiments function given graph Heidelberg identify important improved instance knowledge label learning machine means measure method node objects observed obtained optimal parameters patients patterns performance points possible prediction presented Press problem projections proposed prototypical query random reasoning reduce relations relevant represented retrieval rules sample segments selection shown shows similarity solution space specific statistical step streams structure subset Table task techniques temporal tree types variables vector weight
Populāri fragmenti
161. lappuse - Topic detection and tracking pilot study: Final report. In Proceedings of the DARPA Broadcast News Transcription and Understanding Workshop, pp.
93. lappuse - PCA is an orthogonal linear transformation that transforms the data to a new coordinate system such that the greatest variance by any projection of the data comes to lie on the first coordinate (called the first principal component), the second greatest variance on the second coordinate, and so on.
99. lappuse - Each neuron is represented by d-dimensional weight vector, m= [m, ..... m<j], where d equals to the dimension of the input vectors. The neurons are connected to adjacent neurons by a neighborhood relation, which dictates the structure of the map. SOM training algorithm updates the best matching unit and its topological neighbors on the map. The region around the best matching unit is pulled towards the presented training sample.
12. lappuse - Recall is the ratio of the number of relevant records retrieved to the total number of relevant records in the database.
48. lappuse - In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, July 23-26 2002.
78. lappuse - The organization of the rest of the paper is as follows. In Section 2. we give an overview of the multiprocessor database machine architecture that we have considered.
105. lappuse - References 1. de Oliveira, MCF, Levkowitz, H.: From visual data exploration to visual data mining: A survey. IEEE Trans on Visualization and Computer Graphics 9(3), 378-394 (2003) 2.
105. lappuse - Kramer, MA Nonlinear principal component analysis using autoassociative neural networks.
68. lappuse - GAs operate on a population of potential solutions applying the principle of survival of the fittest to produce (hopefully) better and better approximations to a solution. At each generation, a new set of approximations is created by the process of selecting individuals according to their...