Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,328,664 papers from all fields of science
Search
Sign In
Create Free Account
Data mining
Known as:
Pattern Mining
, Information mining
, Knowledge discovering in databases
Expand
Data mining is an interdisciplinary subfield of computer science. It is the computational process of discovering patterns in large data sets…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
AI winter
Aleksandar Lazarevic
Artificial intelligence (video games)
Behavior informatics
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Learning Semantic Signatures for 3D Object Retrieval
Boqing Gong
,
Jianzhuang Liu
,
Xiaogang Wang
,
Xiaoou Tang
IEEE transactions on multimedia
2013
Corpus ID: 7751753
In this paper, we propose two kinds of semantic signatures for 3D object retrieval (3DOR). Humans are capable of describing an…
Expand
Review
2010
Review
2010
Survey on Frequent Itemset Mining Algorithms
O. Vyas
2010
Corpus ID: 14381848
Many researchers invented ideas to generate the frequent itemsets. The time required for generating frequent itemsets plays an…
Expand
2010
2010
Capture, recognition, and visualization of human semantic interactions in meetings
Zhiwen Yu
,
Zhiyong Yu
,
H. Aoyama
,
Motoyuki Ozeki
,
Yuichi Nakamura
Annual IEEE International Conference on Pervasive…
2010
Corpus ID: 17487410
Human interaction is one of the most important characteristics of group social dynamics in meetings. In this paper, we propose an…
Expand
Highly Cited
2009
Highly Cited
2009
QoS Based Power Aware Routing in MANETs
V. Rishiwal
,
S. Verma
,
S. Bajpai
2009
Corpus ID: 2814576
—In this paper, QoS based power aware routing protocol (Q-PAR) is proposed and evaluated that selects an energy stable QoS…
Expand
Highly Cited
2008
Highly Cited
2008
KYOTO: a System for Mining, Structuring and Distributing Knowledge across Languages and Cultures
P. Vossen
,
Eneko Agirre
,
+12 authors
Joop VanGent
International Conference on Language Resources…
2008
Corpus ID: 3074735
We outline work performed within the framework of a current EC project. The goal is to construct a language-independent…
Expand
2008
2008
Natural Language and Information Systems, 13th International Conference on Applications of Natural Language to Information Systems, NLDB 2008, London, UK, June 24-27, 2008, Proceedings
E. Kapetanios
,
V. Sugumaran
,
M. Spiliopoulou
International Conference on Applications of…
2008
Corpus ID: 35068266
2007
2007
Diffusion Maps and Geometric Harmonics for Automatic Target Recognition (ATR). Volume 2. Appendices
S. Zucker
,
R. Coifman
2007
Corpus ID: 33721827
Abstract : Geometric harmonics provides a framework for taking data in high-dimensional measurement spaces and embedding them in…
Expand
Highly Cited
2006
Highly Cited
2006
Granular SVM with Repetitive Undersampling for Highly Imbalanced Protein Homology Prediction
Yuchun Tang
,
Yanqing Zhang
IEEE International Conference on Granular…
2006
Corpus ID: 11856998
Highly imbalanced classification is important and increasingly common with emergence of new machine learning application domains…
Expand
Highly Cited
2005
Highly Cited
2005
U*F clustering: a new performant "cluster-mining" method based on segmentation of Self-Organizing Maps
F. Moutarde
,
A. Ultsch
2005
Corpus ID: 3889855
In this paper, we propose a new clustering method consisting in automated “flood- fill segmentation” of the U*-matrix of a Self…
Expand
1999
1999
Automatic labeling of self-organizing maps for information retrieval
D. Merkl
,
A. Rauber
ICONIP'99. ANZIIS'99 & ANNES'99 & ACNN'99. 6th…
1999
Corpus ID: 15218899
The self-organizing map is a very popular unsupervised neural network model for the analysis of high-dimensional input data as in…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE