Sciweavers

1314 search results - page 91 / 263
» Approximate data mining in very large relational data
Sort
View
111
Voted
ICPR
2008
IEEE
15 years 8 months ago
An approximate algorithm for median graph computation using graph embedding
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...
Miquel Ferrer, Ernest Valveny, Francesc Serratosa,...
AINA
2006
IEEE
15 years 7 months ago
Peer-to-Peer Usage Analysis: a Distributed Mining Approach
With the huge number of information sources available on the Internet, Peer-to-Peer (P2P) systems offer a novel kind of system architecture providing the large-scale community wit...
Florent Masseglia, Pascal Poncelet, Maguelonne Tei...
135
Voted
DASFAA
2011
IEEE
270views Database» more  DASFAA 2011»
14 years 5 months ago
AutoBayesian: Developing Bayesian Networks Based on Text Mining
Bayesian network is a widely used tool for data analysis, modeling and decision support in various domains. There is a growing need for techniques and tools which can automatically...
Sandeep Raghuram, Yuni Xia, Jiaqi Ge, Mathew Palak...
DATAMINE
1999
108views more  DATAMINE 1999»
15 years 1 months ago
A Survey of Methods for Scaling Up Inductive Algorithms
Abstract. One of the de ning challenges for the KDD research community is to enable inductive learning algorithms to mine very large databases. This paper summarizes, categorizes, ...
Foster J. Provost, Venkateswarlu Kolluri
131
Voted
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 8 days ago
Viewpoints: A high-performance high-dimensional exploratory data analysis tool
Scientific data sets continue to increase in both size and complexity. In the past, dedicated graphics systems at supercomputing centers were required to visualize large data sets,...
Paul R. Gazis, C. Levit, Michael J. Way