Xifeng Yan mainly investigates Data mining, Graph, Artificial intelligence, Machine learning and Theoretical computer science. The concepts of his Data mining study are interwoven with issues in Graph, Set, Support vector machine and Molecule mining. Xifeng Yan has included themes like Data mining algorithm, Scalability, Discriminative model and Substructure in his Graph study.
His Substructure research is multidisciplinary, relying on both Frequent subtree mining, Graph based, Computation and Lexicographical order. His Theoretical computer science research is multidisciplinary, incorporating elements of Graph property, SPARQL, Graph operations and Random graph. Xifeng Yan combines subjects such as Sequential Pattern Mining and Data science with his study of Cluster analysis.
Xifeng Yan focuses on Data mining, Artificial intelligence, Graph, Theoretical computer science and Graph. His work focuses on many connections between Data mining and other disciplines, such as Discriminative model, that overlap with his field of interest in Feature selection. His Artificial intelligence study incorporates themes from Natural language processing, Machine learning and Pattern recognition.
His biological study spans a wide range of topics, including Scalability, Nearest neighbor search and Information retrieval. His Theoretical computer science research integrates issues from Modular decomposition, Subgraph isomorphism problem, Probabilistic logic, Semantics and Partition. His work in Graph is not limited to one particular discipline; it also encompasses Molecule mining.
The scientist’s investigation covers issues in Artificial intelligence, Machine learning, Natural language processing, Relation and Embedding. His work on Natural language, Knowledge base and Generalization error as part of general Artificial intelligence study is frequently connected to Conversation, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them. His Machine learning study combines topics from a wide range of disciplines, such as Text corpus, Graph neural networks and Text generation.
His Graph neural networks study necessitates a more in-depth grasp of Graph. Xifeng Yan interconnects Upper and lower bounds and Graph in the investigation of issues within Graph. His Embedding study integrates concerns from other disciplines, such as Concept mining and Information retrieval.
Xifeng Yan spends much of his time researching Artificial intelligence, Dialog box, Theoretical computer science, Natural language and Semantics. His studies in Artificial intelligence integrate themes in fields like Relation and Natural language processing. His work deals with themes such as Machine learning, Scope and Sequence, which intersect with Relation.
The study incorporates disciplines such as Semantic reasoner, Latent variable, Inference, Upper and lower bounds and Existential quantification in addition to Theoretical computer science. In his research on the topic of Natural language, SIMPLE, Deep learning, Information retrieval, Domain and Paraphrase is strongly related with Parsing. His Semantics study combines topics in areas such as Response generation, Graph, Self attention and Dialog act.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
gSpan: graph-based substructure pattern mining
Xifeng Yan;Jiawei Han.
international conference on data mining (2002)
gSpan: graph-based substructure pattern mining
Xifeng Yan;Jiawei Han.
international conference on data mining (2002)
Frequent pattern mining: current status and future directions
Jiawei Han;Hong Cheng;Dong Xin;Xifeng Yan.
Data Mining and Knowledge Discovery (2007)
Frequent pattern mining: current status and future directions
Jiawei Han;Hong Cheng;Dong Xin;Xifeng Yan.
Data Mining and Knowledge Discovery (2007)
PathSim: meta path-based top-K similarity search in heterogeneous information networks
Yizhou Sun;Jiawei Han;Xifeng Yan;Philip S. Yu.
very large data bases (2011)
PathSim: meta path-based top-K similarity search in heterogeneous information networks
Yizhou Sun;Jiawei Han;Xifeng Yan;Philip S. Yu.
very large data bases (2011)
Graph indexing: a frequent structure-based approach
Xifeng Yan;Philip S. Yu;Jiawei Han.
international conference on management of data (2004)
Graph indexing: a frequent structure-based approach
Xifeng Yan;Philip S. Yu;Jiawei Han.
international conference on management of data (2004)
CloseGraph: mining closed frequent graph patterns
Xifeng Yan;Jiawei Han.
knowledge discovery and data mining (2003)
CloseGraph: mining closed frequent graph patterns
Xifeng Yan;Jiawei Han.
knowledge discovery and data mining (2003)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
University of Illinois at Urbana-Champaign
University of Illinois at Chicago
Chinese University of Hong Kong
Singapore Management University
University of California, Santa Barbara
University of California, Santa Barbara
University of California, Los Angeles
University of California, Santa Barbara
ETH Zurich
Google (United States)
Tsinghua University
Nagoya University
Fuzhou University
Pacific Northwest National Laboratory
Max Planck Society
University of Guelph
Swedish Defence Research Agency
Ghent University
Université Paris Cité
University of California, Merced
King Saud University
National University of Singapore
National Academies of Sciences, Engineering, and Medicine
Florida State University
World Bank
University of British Columbia