Advanced pattern mining for complex data analysis
Own your potential (DEAKIN)Published 1 August 2012
Jia Rong
Citations1
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The thesis has researched a set of critical problems in data mining and has proposed four advanced pattern mining algorithm to discover the most interesting and useful data patterns highly relevant to the user’s application targets from the data is represented in complex structures.
Abstract
\n\t\t\t\t\tThe thesis has researched a set of critical problems in data mining and has proposed four advanced pattern mining algorithm to discover the most interesting and useful data patterns highly relevant to the user’s application targets from the data is represented in complex structures.\n\t\t\t\t
Keywords
Computer Science
Journal of Environmental PsychologyQualitative Data Analysis: An Expanded Sourcebook
45,597 Citations1994
This book presents a step-by-step guide to making the research results presented in reports, slideshows, posters, and data visualizations more interesting, and describes how coding initiates qualitative data analysis.
The Nature of Statistical Learning Theory
39,279 Citations1995Vladimir Vapnik
Elsevier eBooksData Mining: Practical Machine Learning Tools and Techniques
25,718 Citations2011Ian H. Witten, Eibe Frank
Zenodo (CERN European Organization for Nuclear Research)SERVQUAL: A multiple-Item Scale for measuring consumer perceptions of service quality
21,201 Citations1988A. Parasuraman, Valarie A. Zeithaml +1 more
Mining association rules between sets of items in large databases
14,720 Citations1993Rakesh Agrawal, Tomasz Imieliński +1 more
An efficient algorithm is presented that generates all significant association rules between items in the database of customer transactions and incorporates buffer management and novel estimation and pruning techniques.
Fast algorithms for mining association rules
10,739 Citations1998Rakesh Agrawal, Ramakrishnan Srikant
ACM SIGMOD RecordMining frequent patterns without candidate generation
6,360 Citations2000Jiawei Han, Jian Pei +1 more
Mining sequential patterns
5,115 Citations2002R. K. Agrawal, Ramakrishnan Srikant
Three algorithms are presented to solve the problem of mining sequential patterns over databases of customer transactions, and empirically evaluating their performance using synthetic data shows that two of them have comparable performance.
IEEE ExpertData mining and knowledge discovery: making sense out of data
4,643 Citations1996U.M. Feyyad
Find loads of the data mining and knowledge discovery making sense out of data book catalogues in this site as the choice of you visiting this page.
Journal of MarketingEvaluating Service Encounters: The Effects of Physical Surroundings and Employee Responses
4,250 Citations1990Mary Jo Bitner
Foundations of database design/Foundations of database design seriesIntroduction to Database Systems
3,542 Citations2006
Readers of this book will gain a strong working knowledge of the overall structure, concepts, and objectives of database systems and will become familiar with the theoretical principles underlying the construction of such systems.
Data Mining and Knowledge DiscoveryMining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach
2,615 Citations2003Jiawei Han, Jian Pei +2 more
A novel frequent-pattern tree (FP-tree) structure is proposed, which is an extended prefix-tree structure for storing compressed, crucial information about frequent patterns, and an efficient FP-tree-based mining method, FP-growth, is developed for mining the complete set of frequent patterns by pattern fragment growth.
Series on software engineering and knowledge engineeringData Structures and Algorithms
2,131 Citations2003
The basis of this book is the material contained in the first six chapters of the earlier work, The Design and Analysis of Computer Algorithms, and has added material on algorithms for external storage and memory management.
IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews)Educational Data Mining: A Review of the State of the Art
2,127 Citations2010Cristóbal Romero, Sebastián Ventura
The most relevant studies carried out in educational data mining to date are surveyed and the different groups of user, types of educational environments, and the data they provide are described.
ACM SIGKDD Explorations NewsletterWeb usage mining
2,113 Citations2000Jaideep Srivastava, Robert Cooley +2 more
A detailed taxonomy of the work in this area, including research efforts as well as commercial offerings is provided, and a brief overview of the WebSIFT system as an example of a prototypical Web usage mining system is given.
gSpan: graph-based substructure pattern mining
2,030 Citations2003Xifeng Yan, Jiawei Han
A novel algorithm called gSpan (graph-based substructure pattern mining), which discovers frequent substructures without candidate generation by building a new lexicographic order among graphs, and maps each graph to a unique minimum DFS code as its canonical label.
Dynamic itemset counting and implication rules for market basket data
1,954 Citations1997Sergey Brin, Rajeev Motwani +2 more
A new algorithm for finding large itemsets which uses fewer passes over the data than classic algorithms, and yet uses fewer candidate itemsets than methods based on sampling and a new way of generating “implication rules” which are normalized based on both the antecedent and the consequent.
University of Maribor digital library (University of Maribor)Marketing for Hospitality and Tourism
1,892 Citations1995Philip Kotler, John T. Bowen +1 more
Journal of Consumer ResearchResponse Determinants in Satisfaction Judgments
1,686 Citations1988Richard L. Oliver, Wayne S. DeSarbo
Oxford University Press eBooksOxford Dictionary of English
1,629 Citations2010Judy Pearsall
This revised edition of the Oxford Dictionary of English includes hundreds of brand-new words and senses, as well as up-to-date encyclopedic information, and extensive appendices covering topics such as countries, heads of state, and chemical elements.
Journal of the Royal Statistical Society Series B (Statistical Methodology)Conditional Independence in Statistical Theory
1,546 Citations1979A. P. Dawid
Knowledge and Information SystemsData Preparation for Mining World Wide Web Browsing Patterns
1,464 Citations1999Robert Cooley, Bamshad Mobasher +1 more
This paper presents several data preparation techniques in order to identify unique users and user sessions and Transactions identified by the proposed methods are used to discover association rules from real world data using the WEBMINER system.
ACM SIGKDD Explorations NewsletterWeb mining research
1,439 Citations2000Raymond Kosala, Hendrik Blockeel
This paper surveys the research in the area of Web mining, point out some confusions regarded the usage of the term Web mining and suggest three Web mining categories, which are then situate some of the research with respect to these three categories.
Data Mining and Knowledge DiscoveryFrequent pattern mining: current status and future directions
1,384 Citations2007Jiawei Han, Hong Cheng +2 more
It is believed that frequent pattern mining research has substantially broadened the scope of data analysis and will have deep impact on data mining methodologies and applications in the long run, however, there are still some challenging research issues that need to be solved before frequent patternmining can claim a cornerstone approach in data mining applications.
TechnometricsData Mining: Concepts, Models, Methods, and Algorithms
1,377 Citations2003
This book reviews state-of-the-art methodologies and techniques for analyzing enormous quantities of raw data in high-dimensional data spaces, to extract new information for decision making.
Efficiently mining long patterns from databases
1,297 Citations1998Roberto J. Bayardo
A pattern-mining algorithm that scales roughly linearly in the number of maximal patterns embedded in a database irrespective of the length of the longest pattern, compared with previous algorithms that scale exponentially with longest pattern length.
Beyond market baskets
1,287 Citations1997Sergey Brin, Rajeev Motwani +1 more
This work develops the notion of mining rules that identify correlations (generalizing associations), and proposes measuring significance of associations via the chi-squared test for correlation from classical statistics, enabling the mining problem to reduce to the search for a border between correlated and uncorrelated itemsets in the lattice.
ACM Computing SurveysInterestingness measures for data mining
1,125 Citations2006Liqiang Geng, Howard J. Hamilton
This survey reviews the interestingness measures for rules and summaries, classifies them from several perspectives, compares their properties, identifies their roles in the data mining process, gives strategies for selecting appropriate measures for applications, and identifies opportunities for future research in this area.
Convolution kernels on discrete structures
1,089 Citations1999David Haussler
A new method of constructing kernels on sets whose elements are discrete structures like strings, trees and graphs is introduced, which can be applied iteratively to build a kernel on a innnite set from kernels involving generators of the set.
Sampling Large Databases for Association Rules
1,079 Citations1996Hannu Toivonen
New algorithms that reduce the database activity considerably by picking a Random sample, to find using this sample all association rules that probably hold in the whole database, and then to verify the results with the rest of the database.
Efficient mining of emerging patterns
1,005 Citations1999Guozhu Dong, Jinyan Li
It is believed that EPs with low to medium support, such as 1%-20%, can give useful new insights and guidance to experts, in even “well understood” applications.
Proceedings of the National Academy of SciencesCoupled two-way clustering analysis of gene microarray data
820 Citations2000Gad Getz, Erel Levine +1 more
An algorithm, based on iterative clustering, that performs an algorithm to identify subsets of the genes and samples, such that when one of these is used to cluster the other, stable and significant partitions emerge.
International Journal of Hospitality ManagementDeterminants of hotel guests’ satisfaction and repeat patronage in the Hong Kong hotel industry
720 Citations2001Tat Y. Choi, Raymond Chu
Expert Systems with ApplicationsSentiment classification of online reviews to travel destinations by supervised machine learning approaches
631 Citations2008Qiang Ye, Ziqiong Zhang +1 more
This research compared three supervised machine learning algorithms of Naive Bayes, SVM and the character based N-gram model for sentiment classification of the reviews on travel blogs for seven popular travel destinations in the US and Europe.
Fast vertical mining using diffsets
586 Citations2003Mohammed J. Zaki, Karam Gouda
This paper presents a novel vertical data representation called Diffset, that only keeps track of differences in the tids of a candidate pattern from its generating frequent patterns, and shows that diffsets drastically cut down the size of memory required to store intermediate results.
CLOSET+
582 Citations2003Jianyong Wang, Jiawei Han +1 more
Efficient mining of partial periodic patterns in time series database
581 Citations1999Jiawei Han, Guozhu Dong +1 more
This work presents several algorithms for efficient mining of partial periodic patterns by exploring some interesting properties related to partial periodicity such as the Apriori property and the max-subpattern hit set property, and by shared mining of multiple periods.
Trends in Biochemical SciencesDealing with energy demand: the AMP-activated protein kinase
518 Citations1999Bruce E. Kemp, Ken I. Mitchelhill +4 more
The AMP-activated protein kinase yeast homolog, Snf1p, plays a major role in adaption to glucose deprivation, and has diverse roles that extend from energy metabolism through to transcriptional control in mammals.
ACM Transactions on Information SystemsEfficient mining of both positive and negative association rules
469 Citations2004Xindong Wu, Chengqi Zhang +1 more
This paper presents an efficient method for mining both positive and negative association rules in databases, and extends traditional associations to include association rules of forms A ⇒ ¬ , which indicate negative associations between itemsets.
ACM SIGKDD Explorations NewsletterState of the art of graph-based data mining
446 Citations2003Takashi Washio, Hiroshi Motoda
This article introduces the theoretical basis of graph based data mining and surveys the state of the art of graph-based data mining.
Mining molecular fragments: finding relevant substructures of molecules
438 Citations2003Christian Borgelt, Michael R. Berthold
An algorithm to find fragments in a set of molecules that help to discriminate between different classes of for instance, activity in a drug discovery context is presented, which results in substantially faster search by eliminating the need for frequent, computationally expensive reembeddings and by suppressing redundant search.
Clustering association rules
376 Citations2002Brian Lent, A. Swami +1 more
The authors present a geometric-based algorithm, BitOp, for performing the clustering, embedded within an association rule clustering system, ARCS, and measure the quality of the segmentation generated by ARCS using the minimum description length (MDL) principle of encoding the clusters on several databases.
DiabetesAMP-Activated Protein Kinase (AMPK) Is Activated in Muscle of Subjects With Type 2 Diabetes During Exercise
370 Citations2001Nicolas Musi, Nobuharu Fujii +6 more
People with type 2 diabetes have normal exercise-induced AMPK alpha2 activity and normal expression of the alpha1, alpha2 and beta1 isoforms and Pharmacological activation of AMPK may be an attractive target for the treatment of type 2abetes.
Journal of Travel & Tourism MarketingINFORMATION TECHNOLOGY APPLICATIONS IN HOSPITALITY AND TOURISM: A REVIEW OF PUBLICATIONS FROM 2005 TO 2007
366 Citations2009Rob Law, Rosanna Leung +1 more
It is demonstrated that IT is increasingly becoming critical for the competitive operations of the tourism and hospitality organizations as well as for managing the distribution and marketing of organizations on a global scale.
Data Mining and Knowledge DiscoveryDetecting Group Differences: Mining Contrast Sets
362 Citations2001Stephen D. Bay, Michael J. Pazzani
This work provides a search algorithm for mining contrast sets with pruning rules that drastically reduce the computational complexity and post-process the results to present a subset that is surprising to the user given what the user has already shown.
Journal of Biological ChemistryRegulation of Hepatic Acetyl Coenzyme A Carboxylase by Phosphorylation and Dephosphorylation
341 Citations1973Curtis A. Carlson, Ki-Han Kim
Mining frequent itemsets with convertible constraints
324 Citations2002Jian Pei, Jiawei Han +1 more
A notion of convertible constraints is developed and systematically analyzed, classify, and characterize this class and techniques which enable them to be readily pushed deep inside the recently developed FP-growth algorithm for frequent itemset mining are developed.
ACM Computing SurveysAssociation mining
322 Citations2006Aaron Ceglar, John F. Roddick
A survey of association mining fundamentals is presented, detailing the evolution of associationmining algorithms from the seminal to the state-of-the-art, that is, itemset identification, rule generation, and their generic optimizations.
IEEE Transactions on Knowledge and Data EngineeringEfficiently mining frequent trees in a forest: algorithms and applications
308 Citations2005Mohammed J. Zaki
This work presents TREEMINER, a novel algorithm to discover all frequent subtrees in a forest, using a new data structure called scope-list, and contrasts it with a pattern matching tree mining algorithm (PATTERNMATCHER), and also compares it with TREEMinERD, which counts only distinct occurrences of a pattern.
The MIT Press eBooksFast Kernels for String and Tree Matching
293 Citations2004S. V. N. Vishwanathan, Alexander J. Smola
A new algorithm suitable for matching discrete objects such as strings and trees in linear time is presented, thus obviating dynamic programming with quadratic time complexity and improvement on the currently available algorithms makes string kernels a viable alternative for the practitioner.
Fundamenta InformaticaeFrequent Subtree Mining - An Overview
264 Citations2004Yün Chi, Richard R. Muntz +2 more
An overview of a broad range of tree mining algorithms focusing on the common theoretical foundations of the current frequent subtree mining algorithms and their relationship with their counterparts in frequent itemset mining is provided.
Knowledge Discovery and Data MiningSubstructure discovery in the SUBDUE system
217 Citations1994Lawrence B. Holder, Diane J. Cook +1 more
The SUBDUE system, which uses the minimum description length (MDL) principle to discover substructures that compress the database and represent structural concepts in the data, is described.
IEEE Transactions on Knowledge and Data EngineeringTFP: an efficient algorithm for mining top-k frequent closed itemsets
213 Citations2005Jianyong Wang, Jiawei Han +2 more
This paper proposes an alternative mining task: mining top-k frequent closed itemsets of length no less than min/spl I.bar/support, and shows that TFP has high performance and linear scalability in terms of the database size.
Metarule-Guided Mining of Multi-Dimensional Association RulesUsing Data Cubes
209 Citations1997Micheline Kamber, Jiawei Han +1 more
A novel approach to metarule-guided, multi-dimensional association rule mining which explores a data cube structure and proposes an efficient method for precomputing the cube, which takes into account the constraints imposed by the given meetarule.
Lecture notes in computer scienceDiscovering Frequent Substructures in Large Unordered Trees
171 Citations2003Tatsuya Asai, Hiroki Arimura +2 more
An efficient algorithm Unot is presented that computes all frequent labeled unordered trees appearing in a large collection of data trees with frequency above a user-specified threshold and finds each frequent pattern T in O(kb 2 m) per pattern.
Linear Algebra and its ApplicationsStrongly regular graphs with (—1,1,0) adjacency matrix having eigenvalue 3
170 Citations1968J.J. Seidel
BioinformaticsIdentifying good diagnostic gene groups from gene expression profiles using the concept of emerging patterns
155 Citations2002Jinyan Li, Limsoon Wong
Based on the discovered patterns, the possibility of a personalized treatment plan which converts colon tumor cells into normal cells by modulating the expression levels of a few genes is conjecture.
Acta Physiologica ScandinavicaAMP‐activated protein kinase and muscle glucose uptake
146 Citations2003Nicolas Musi, Laurie J. Goodyear
The effects of AMPK on muscle glucose uptake makes this protein a promising pharmacological target for the treatment of type 2 diabetes.
Sequential Pattern Mining: A Survey
134 Citations2003Qiankun Zhao, Sourav S. Bhowmick
The main process of KDD is the data mining process, in this process different algorithms are applied to produce hidden knowledge, which evaluates the mining result according to users’ requirements and domain knowledge.
BioinformaticsSimple rules underlying gene expression profilesof more than six subtypes of acute lymphoblastic leukemia (ALL)patients
132 Citations2002Jinyan Li, Huiqing Liu +3 more
Novel rules that describe the gene expression profiles of more than six subtypes of acute lymphoblastic leukemia (ALL) patients are discovered and a new classifier is introduced, named PCL, to make effective use of the rules.
Data Mining and Knowledge DiscoveryMining Web Log Sequential Patterns with Position Coded Pre-Order Linked WAP-Tree
131 Citations2005C. I. Ezeife, Yi Lu
The proposed algorithm builds the frequent header node links of the original WAP-tree in a pre-order fashion and uses the position code of each node to identify the ancestor/descendant relationships between nodes of the tree.
Parallel data mining for association rules on shared-memory multi-processors
130 Citations1996Mohammed J. Zaki, Mitsunori Ogihara +2 more
This paper presents parallel algorithms for data mining of association rules, and studies the degree of parallelism, synchronization, and data locality issues on the SGI Power Challenge shared-memory multi-processor.
Challenges in mining social network data
128 Citations2007Jon Kleinberg
A family of attacks such that even from a single anonymized copy of a social network, it is possible for an adversary to learn whether edges exist or not between specific targeted pairs of nodes is described, suggesting that anonymization contains pitfalls even in very simple settings.
Efficient data mining for maximal frequent subtrees
122 Citations2004YingJian Xiao, Jun Yao
A new type of tree mining is defined, which uncovers maximal frequent induced subtrees from a database of unordered labeled trees and a novel algorithm, PathJoin, which uses a compact data structure, FST-Forest, which compresses the trees and still keeps the original tree structure.
Kernels for Semi-Structured Data
121 Citations2002Hisashi Kashima, Teruo Koyanagi
This paper model semi-structured data by labeled ordered trees, and presents kernels for classifying labeled ordering trees based on their tag structures by generalizing the convolution kernel for parse trees introduced by Collins and Duffy (2001).
Elsevier eBooksEfficient Mining of XML Query Patterns for Caching
118 Citations2003Liang Huai Yang, Mong Li Lee +1 more
Theorems are developed to prove that only a small subset of the generated candidate patterns needs to undergo expensive tree containment tests, and it is demonstrated how the frequent query patterns can be used to improve caching performance.
HybridTreeMiner: an efficient algorithm for mining frequent rooted trees and free trees using canonical forms
110 Citations2004Yün Chi, Yirong Yang +1 more
HybridTreeMiner is a computationally efficient algorithm that discovers all frequently occurring subtrees in a database of rooted unordered trees by traversing an enumeration tree that systematically enumerates all subtrees.
Lecture notes in computer scienceEfficient Pattern-Growth Methods for Frequent Tree Pattern Mining
100 Citations2004Chen Wang, Mingsheng Hong +4 more
An extensive performance study shows that the two newly developed algorithms outperform TreeMinerV [13], one of the fastest methods proposed before, in mining large databases.
Tourism ManagementA behavioral analysis of web sharers and browsers in Hong Kong using targeted association rule mining
95 Citations2011Jia Rong, Huy Quan Vu +2 more
This study investigates eWOM in the context of the tourism industry using an outbound domestic tourism data set that was recently collected in Hong Kong and the results are useful in helping tourism managers to define new target customers and to plan more effective marketing strategies.
Journal of Clinical InvestigationAMP-activated protein kinase: the guardian of cardiac energy status
91 Citations2004D. Grahame Hardie
This directly tested the effects of ischemia and reperfusion in perfused hearts from mice expressing a dominant-negative mutant that suppresses the kinase activity in cardiac muscle, and showed clear evidence for increased necrotic damage and increased apoptosis.
BioinformaticsA CART-based approach to discover emerging patterns in microarray data
86 Citations2003Anne‐Laure Boulesteix, Gerhard Tutz +1 more
This work introduces a CART-based approach to discover EPs in microarray data that combines pattern search with a statistical procedure based on Fisher's exact test to assess the significance of each EP and assigns statistical significance to the inferred EPs.
Data Mining and Knowledge DiscoveryMining top-K frequent itemsets from data streams
75 Citations2006Raymond Chi-Wing Wong, Ada Wai-Chee Fu
A method based on the Chernoff bound with a guarantee of the output quality and also a bound on the memory usage is introduced and an algorithmbased on the Lossy Counting Algorithm is proposed for frequent pattern mining on data streams.
Lecture notes in computer scienceInstance-Based Classification by Emerging Patterns
72 Citations2000Jinyan Li, Guozhu Dong +1 more
A new, instance-based classifier using EPs, called DeEPs, is proposed to achieve much better accuracy and efficiency than the previously proposed EP- based classifiers, and is superior to other classifiers on accuracy.
Frequent free tree discovery in graph data
72 Citations2004Ulrich Rückert, Stefan Krämer
This paper is investigating the middle ground between these two extremes: mining free trees in graph data, and defining free trees and their canonical form, before presenting FreeTreeMiner, an algorithm making efficient use of this canonical form during search.
Multivariate discretization of continuous variables for set mining
70 Citations2000Stephen D. Bay
It is argued that this is a sub-optimal approach for knowledge discovery as univariate discretization can destroy hidden patterns in data and presented a bottom up merging algorithm to discretize continuous variables based on this rule.
Unordered tree mining with applications to phylogeny
65 Citations2004Dennis Shasha, J.T.L. Wang +1 more
A new FSM technique for finding patterns in rooted unordered labeled trees, which discusses its applications to locating co-occurring patterns in multiple evolutionary trees, evaluating the consensus of equally parsimonious trees, and finding kernel trees of groups of phylogenies.
Proceedings of the National Academy of SciencesCell density regulates cellular reversal frequency in Myxococcus xanthus.
62 Citations1996Wenyuan Shi, Frances K. Ngok +1 more
It is found that developmental cells in large groups reverse much less than cells in small groups or as single cells, suggesting a simple hypothesis for the aggregation of cells into discrete mounds during fruiting body formation.
SadhanaData mining in e-commerce: A survey
60 Citations2005N. R. Srinivasa Raghavan
The intent is not to survey the plethora of algorithms in data mining; instead, the current focus being e-commerce, the discussion is limited to data mining in the context of e- commerce.
Frequent subgraph mining in outerplanar graphs
58 Citations2006Tamás Horváth, Jan Ramon +1 more
Tourism ManagementIdentifying changes and trends in Hong Kong outbound tourism
56 Citations2010Rob Law, Jia Rong +3 more
On computing, storing and querying frequent patterns
50 Citations2003Guimei Liu, Hongjun Lü +2 more
This paper proposes a disk-based data structure, CFP-tree (Condensed Frequent Pattern Tree), for organizing frequent patterns discovered from transactional databases and developed algorithms to efficiently support two important types of queries, namely queries with minimum support constraints and queries with item constraints, against the stored patterns.
Association rule and quantitative association rule mining among infrequent items
47 Citations2007Ling Zhou, Stephen S.‐T. Yau
This paper proposes two simple, practical and effective schemes to mine association rules among rare items and explores quantitative association rule mining in transactional database among infrequent items by associating quantities of items purchased.
BMC BioinformaticsMining frequent patterns for AMP-activated protein kinase regulation on skeletal muscle
44 Citations2006Qingfeng Chen, Yi‐Ping Phoebe Chen
AMP-activated protein kinase has a great impact on most metabolic actions that are related to energy demand and supply and those actions are adjusted via its subunit isoforms under specific physical training, indicating there are strong co-relationships between AMPK sub unit isoforms and exercises.
Lecture notes in computer scienceCondensed Representation of Emerging Patterns
39 Citations2004Arnaud Soulet, Bruno Crémilleux +1 more
An exact condensed representation of emerging patterns is proposed and a method to provide EPs with the highest growth rates is given, called strong emerging patterns (SEPs), in collaboration with the Philips company.
Convolution kernels with feature selection for natural language processing tasks
37 Citations2004Jun Suzuki, Hideki Isozaki +1 more
A new approach based on statistical feature selection is proposed that avoids the over-fitting problem when convolution kernels are used in NLP tasks and is embedded into an original kernel calculation process by using sub-structure mining algorithms.
Sequence and Tree Kernels with Statistical Feature Mining
35 Citations2005Jun Suzuki, Hideki Isozaki
This paper discusses the issue of convolution kernels and proposes a statistical feature selection that enable us to use larger sub-structures effectively and compares the performance of a conventional method to that of the proposed method.
Service BusinessData mining in business services
33 Citations2006David L. Olson
Approaches of data mining relevant to the service industry are reviewed, primary business functions and data mining methods are demonstrated, and major software tools noted.
Nuclear Instruments and Methods in Physics Research Section A Accelerators Spectrometers Detectors and Associated EquipmentIdentifying markers of pathology in SAXS data of malignant tissues of the brain
31 Citations2005Karen K. W. Siu, Shane M. Butler +12 more
To evaluate the diagnostic potential of SAXS for brain tumors, data was collected from normal, malignant and benign tissues of the human brain at station 2.1 of the Daresbury Laboratory Synchrotron Radiation Source and subjected to data mining and multivariate statistical analysis, and results suggestSAXS data may be an effective classifier of malignancy.
Data Mining and Knowledge DiscoveryMining Surprising Periodic Patterns
31 Citations2004Jiong Yang, Wei Wang +1 more
The concept of information gain is proposed to measure the overall degree of surprise of the pattern within a data sequence and the bounded information gain property is identified to tackle the predicament caused by the violation of the downward closure property by the information gain measure.
Intelligent Data AnalysisFrequent tree pattern mining: A survey
28 Citations2010Aı́da Jiménez, Fernando Berzal +1 more
This paper examines some of the most relevant tree mining algorithms and compare them in order to highlight their similarities and differences.
Authorship classification
27 Citations2011Sang Kyum Kim, Hyungsul Kim +3 more
This paper proposes a new feature set of k-embedded-edge subtree patterns that holds more syntactic information than previous feature sets and proposes a novel approach to directly mining them from a given set of syntactic trees.
Lecture notes in computer scienceGroup SAX: Extending the Notion of Contrast Sets to Time Series and Multimedia Data
25 Citations2006Jessica Lin, Eamonn Keogh
This work reformulates the notion of contrast-sets for time series data, and defines it to be the key pattern(s) that are maximally different from the other set of data.
ACM SIGKDD Explorations NewsletterMaking pattern mining useful
25 Citations2010Jilles Vreeken
This thesis proposes to use the Minimum Description Length principle to select small groups of patterns that together describe the data well, and introduces KRIMP: a heuristic for finding the itemsets that together optimally compress the database.
A Novel Model of Working Set Selection for SMO Decomposition Methods
24 Citations2007Zhendong Zhao, Lei Yuan +4 more
A new model for working set selection in sequential minimal optimization (SMO) decomposition methods is proposed, which selects B as working set without reselection.
International Journal of Hospitality & Tourism AdministrationTourists' Perceptions Towards Hotel Services in New Zealand
24 Citations2004Gurvinder S. Shergill, Wenli Sun
Approximate Tree Kernels
24 Citations2010Konrad Rieck, Tammo Krueger +2 more
Mining Substructures in Protein Data
22 Citations2006Fedja Hadzic, Tharam S. Dillon +3 more
The MB3 tree mining algorithm, which given a minimum support threshold, efficiently discovers all frequent embedded subtrees from a database of rooted ordered labeled subtrees is applied to the Prions database and is shown to be a viable technique for mining protein data.
…