Manifold Learning in Data Mining Tasks
Many Data Mining tasks deal with data which are presented in high dimensional spaces, and the ‘curse of dimensionality’ phenomena is often an obstacle to the use of many methods for solving these tasks. To avoid these phenomena, various Representation learning algorithms are used as a first key step in solutions of these tasks to transform the original high-dimensional data into their lower-dimensional representations so that as much information about the original data required for the considered Data Mining task is preserved as possible. The above Representation learning problems are formulated as various Dimensionality Reduction problems (Sample Embedding, Data Manifold embedding, Manifold Learning and newly proposed Tangent Bundle Manifold Learning) which are motivated by various Data Mining tasks. A new geometrically motivated algorithm that solves the Tangent Bundle Manifold Learning and gives new solutions for all the considered Dimensionality Reduction problems is presented.
The 13rd IEEE International Conference on Data Mining (IEEE ICDM 2013) has solicited workshops on topics related to new research directions and novel applications of data mining. The goal of the ICDM workshops program (IEEE ICDMW) is to identify grand challenges in data mining, to explore the possible paths to address these urgent problems, and to solicit broad participation from the data mining community and other relevant research communities. IEEE ICDMW 2013 was held on December 7 in Dallas, Texas, USA, and was immediately followed by IEEE ICDM 2013. This year, we have received 41 workshop proposals, a 141% increase from the number of proposals in the previous year. Of those submissions, 26 workshop proposals were accepted through a thorough review by the ICDMW workshop organization committee. 18 workshops eventually made their way to prepare their workshop programs after a rigorous paper review process. The final program consisted of 13 full-day workshops and 5 halfday workshops. Overall, the ICDMW Program received 364 submissions, which is a 19% increase from the number of submissions in the previous year. Of those submissions, 183 papers were accepted. The workshop proposal acceptance rate is about 44%, and the workshop papers acceptance rate is about 50%. The highly competitive acceptance rates have resulted in the highquality and exciting ICDMW proceedings. IEEE ICDMW 2013 covered many new research and application areas as well as fundamental data mining topics. The traditional and fundamental disciplines included spatial and spatiotemporal data mining, optimization, concept drift, domain driven data mining, opinion mining, and sentiment analysis. Emerging disciplines included high-dimensional data mining, causal discovery, cloud and distributed computing, data mining in service applications, and of course, big data. IEEE ICDMW 2013 provided discussion forums for exciting applications including biological data mining in healthcare, data mining in networks, data privacy, and data mining case studies. The ICDMW Program also explored new areas of data markets in sciences and businesses, data mining in experimental economics, and data mining in astronomical problems. Many people worked together in organizing IEEE ICDMW 2013. We would like to thank all workshop organizers for the high-quality workshop proposals received. The workshop organizers are the key to the success of the ICDMW program. We should thank them all for their tremendous effort putting together 18 exciting workshops in the final program.
Objects have a variety of different features that can be represented as probability distributions. Recent findings show that in addition to mean and variance, the visual system can also encode the shape of feature distributions for features like color or orientation. In an odd-one-out search task we investigated observers' ability to encode two feature distributions simultaneously. Our stimuli were defined by two distinct features (color and orientation) while only one was relevant to the search task. We investigated whether the irrelevant feature distribution influences learning of the task-relevant distribution and whether observers also encode the irrelevant distribution. Although considerable learning of feature distributions occurred, especially for color, our results also suggest that adding a second irrelevant feature distribution negatively affected the encoding of the relevant one and that little learning of the irrelevant distribution occurred. There was also an asymmetry between the two different features: Searching for the oddly oriented target was more difficult than searching for the oddly colored target, which was reflected in worse learning of the color distribution. Overall, the results demonstrate that it is possible to encode information about two feature distributions simultaneously but also reveal considerable limits to this encoding.
This paper considers a data analysis system for collaborative platforms which was developed by the joint research team of the National Research University Higher School of Economics and the Witology company. Our focus is on describing the methodology and results of the first experiments. The developed system is based on several modern models and methods for analysing of object-attribute and unstructured data (texts) such as Formal Concept Analysis, multimodal clustering, association rule mining, and keyword and collocation extraction from texts.
This volume contains the extended version of selected talks given at the international research workshop "Coping with Complexity: Model Reduction and Data Analysis", Ambleside, UK, August 31 – September 4, 2009. The book is deliberately broad in scope and aims at promoting new ideas and methodological perspectives. The topics of the chapters range from theoretical analysis of complex and multiscale mathematical models to applications in e.g., fluid dynamics and chemical kinetics.