Sciweavers

3070 search results - page 333 / 614
» Making pattern mining useful
Sort
View
KDD
2000
ACM
97views Data Mining» more  KDD 2000»
15 years 10 months ago
Towards an effective cooperation of the user and the computer for classification
Decision trees have been successfully used for the task of classification. However, state-of-the-art algorithms do not incorporate the user in the tree construction process. This ...
Mihael Ankerst, Martin Ester, Hans-Peter Kriegel
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
15 years 8 months ago
Less is More: Compact Matrix Decomposition for Large Sparse Graphs
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
Jimeng Sun, Yinglian Xie, Hui Zhang, Christos Falo...
KDD
2010
ACM
208views Data Mining» more  KDD 2010»
15 years 5 months ago
Towards mobility-based clustering
Identifying hot spots of moving vehicles in an urban area is essential to many smart city applications. The practical research on hot spots in smart city presents many unique feat...
Siyuan Liu, Yunhuai Liu, Lionel M. Ni, Jianping Fa...
MSS
1999
IEEE
73views Hardware» more  MSS 1999»
15 years 11 months ago
Hiding HSM Systems from the User
File life-times longer than the life-time of HSMsystems make it necessary to move files from one HSM-system to another. Such a migration takes a long time and cannot be hidden fro...
Hartmut Reuter
COMBINATORICS
2004
103views more  COMBINATORICS 2004»
15 years 6 months ago
On the Counting of Fully Packed Loop Configurations: Some New Conjectures
New conjectures are proposed on the numbers of FPL configurations pertaining to certain types of link patterns. Making use of the Razumov and Stroganov Ansatz, these conjectures a...
Jean-Bernard Zuber