Sciweavers

214 search results - page 38 / 43
» New Parallel Algorithms for Frequent Itemset Mining in Very ...
Sort
View
ECAI
2010
Springer
13 years 7 months ago
Parallel TBox Classification in Description Logics - First Experimental Results
Abstract. One of the most frequently used inference services of description logic reasoners classifies all named classes of OWL ontologies into a subsumption hierarchy. Due to emer...
Mina Aslani, Volker Haarslev
SDM
2008
SIAM
118views Data Mining» more  SDM 2008»
13 years 8 months ago
Massive-Scale Kernel Discriminant Analysis: Mining for Quasars
We describe a fast algorithm for kernel discriminant analysis, empirically demonstrating asymptotic speed-up over the previous best approach. We achieve this with a new pattern of...
Ryan Riegel, Alexander Gray, Gordon Richards
DLOG
2010
13 years 4 months ago
TBox Classification in Parallel: Design and First Evaluation
Abstract. One of the most frequently used inference services of description logic reasoners classifies all named classes of OWL ontologies into a subsumption hierarchy. Due to emer...
Mina Aslani, Volker Haarslev
WWW
2008
ACM
14 years 7 months ago
Statistical properties of community structure in large social and information networks
A large body of work has been devoted to identifying community structure in networks. A community is often though of as a set of nodes that has more connections between its member...
Jure Leskovec, Kevin J. Lang, Anirban Dasgupta, Mi...
AINA
2006
IEEE
14 years 23 days 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...