{"id":265769,"date":"2026-07-16T14:25:17","date_gmt":"2026-07-16T11:25:17","guid":{"rendered":"https:\/\/1kitap1.com\/en\/linear-algebra-tools-for-data-mining-2e-dan-a-simovici\/"},"modified":"2026-07-16T14:25:17","modified_gmt":"2026-07-16T11:25:17","slug":"linear-algebra-tools-for-data-mining-2e-dan-a-simovici","status":"publish","type":"post","link":"https:\/\/1kitap1.com\/en\/linear-algebra-tools-for-data-mining-2e-dan-a-simovici\/","title":{"rendered":"Linear Algebra Tools For Data Mining 2E – Dan A Simovici"},"content":{"rendered":"
\"<\/figure>\n

Indeed, for u, v \u2208Rn, we have cos \u2220(ha(u), ha(v)) = ha(u)\u2032ha(v)) \u2225ha(u)\u22252\u2225ha(v)\u22252 = u\u2032v \u2225u\u22252\u2225v\u22252 = cos \u2220(u, v). The set of dilations having a non-zero ratio is easily seen to be a group, where (ha)\u22121 = h 1 a . 6.18 Condition Numbers for Matrices Let Au = b be a linear system, where A \u2208Cn\u00d7n is a non-singular matrix and b \u2208Rn. We examine the sensitivity of the solution of this system to small variations of b.<\/p>\n

So, together with the original system, we work with a system of the form Av = b + h, where h \u2208Rn is the perturbation of b. Note that A(v \u2212u) = h, so v \u2212u = A\u22121b. Using a vector norm \u2225\u00b7 \u2225and its corresponding matrix norm ||| \u00b7 |||, we have \u2225v \u2212u\u2225= \u2225A\u22121h\u2225\u2a7d|||A\u22121|||\u2225h\u2225. Since \u2225b\u2225= \u2225Au\u2225\u2a7d|||A|||\u2225u\u2225, it follows that \u2225v \u2212u\u2225 \u2225u\u2225 \u2a7d|||A\u22121|||\u2225h\u2225 \u2225b\u2225 = |||A||||||A\u22121|||\u2225h\u2225 \u2225b\u2225 . (6.33) Thus, the relative variation of the solution, \u2225v\u2212u\u2225 \u2225u\u2225, is upper bounded by the number |||A||||||A\u22121|||\u2225h\u2225 \u2225b\u2225 .<\/p>\n

These considerations justify the follow- ing de\ufb01nition. De\ufb01nition 6.34. Let A \u2208Cn\u00d7n be a non-singular matrix. The con- dition number of A relative to the matrix norm ||| \u00b7 ||| is the number cond(A) = |||A||||||A\u22121|||. Equality (6.33) implies that if the condition number is large, then small variations in b may generate large variations in the solution of the system Au = b, especially when b is close to 0.<\/p>\n

When this is the Norms and Inner Products case, we say that the system Au = b is ill-conditioned. Otherwise, the system Au = b is well-conditioned. Theorem 6.72. Let A \u2208Cn\u00d7n be a non-singular matrix. The fol- lowing statements hold for every matrix norm induced by a vector norm: (i) cond(A) = cond(A\u22121); (ii) cond(cA) = |c|cond(A); (iii) cond(A) \u2a7e1. Proof. We prove here only Part (iii). Since AA\u22121 = I, by the properties of a matrix norm induced by a vector norm, we have cond(A) = |||A||||||A\u22121||| \u2a7e|||AA\u22121||| = |||In||| = 1.<\/p>\n

\u25a1 Let A, B be two non-singular matrices in Cn\u00d7n such that B = aA, where a \u2208C. We have B\u22121 = aA\u22121, |||B||| = |a||||B|||, and |||B\u22121||| = |a||||A\u22121||| so cond(B) = |a|2cond(A). On the other hand, det(B) = an det(A).<\/p>\n

\n

This page intentionally left blank This page intentionally left blank This page intentionally left blank This page intentionally left blank Published by World Scientific Publishing Co. Pte. Ltd. 5 Toh Tuck Link, Singapore 596224 USA office: 27 Warren Street, Suite 401-402, Hackensack, NJ 07601 UK office: 57 Shelton Street, Covent Garden, London WC2H 9HE Library of Congress Cataloging-in-Publication Data Names: Simovici, Dan A., author.<\/p>\n

Title: Linear algebra tools for data mining \/ Dan A. Simovici, University of Massachusetts Boston, USA, Dana-Farber Cancer Institute, USA. Description: Second edition. | New Jersey : World Scientific Publishing Co. Pte. Ltd., [2023] | Includes bibliographical references and index. Identifiers: LCCN 2022062233 | ISBN 9789811270338 (hardcover) | ISBN 9789811270345 (ebook for institutions) | ISBN 9789811270352 (ebook for individuals) Subjects: LCSH: Data mining. | Parallel processing (Electronic computers) | Computer algorithms.<\/p>\n

| Linear programming. Classification: LCC QA76.9.D343 S5947 2023 | DDC 006.3\/12–dc23\/eng\/20230210 LC record available at https:\/\/lccn.loc.gov\/2022062233 British Library Cataloguing-in-Publication Data A catalogue record for this book is available from the British Library. Copyright \u00a9 2023 by World Scientific Publishing Co. Pte. Ltd. All rights reserved. This book, or parts thereof, may not be reproduced in any form or by any means, electronic or mechanical, including photocopying, recording or any information storage and retrieval system now known or to be invented, without written permission from the publisher.<\/p>\n

For photocopying of material in this volume, please pay a copying fee through the Copyright Clearance Center, Inc., 222 Rosewood Drive, Danvers, MA 01923, USA. In this case permission to photocopy is not required from the publisher. For any available supplementary material, please visit https:\/\/www.worldscientific.com\/worldscibooks\/10.1142\/13248#t=suppl Desk Editors: Balasubramanian\/Steven Patt Typeset by Stallion Press Email: enquiries@stallionpress.com Printed in Singapore To my wife, Doina, and to the memory of my brother, Dr. George Simovici This page intentionally left blank This page intentionally left blank This page intentionally left blank This page intentionally left blank Preface Linear algebra plays an increasingly important role in data mining and pattern recognition research either directly, or through the appli- cations of linear algebra in graph theory and optimization.<\/p>\n

Linear algebra-based algorithms are elegant and fast, are based on a common mathematical doctrine with its collection of basic ideas and techniques, and are easy to implement; they are especially suit- able for parallel and distributed computation to approach large-scale challenging problems such as searching and extracting patterns from the entire web. Thus, the application of linear algebra-based tech- niques in data mining and machine learning research constitute an increasingly attractive area. Many linear algebra results are impor- tant for their applications in biology, chemistry, psychology, and sociology.<\/p>\n

The standard undergraduate education of a computer scientist includes one or, rarely, two semesters of linear algebra, which is woefully inadequate for a researcher in data mining or pattern recog- nition.<\/p>\n<\/blockquote>\n

This is a short excerpt from the opening of “” by Unknown, quoted for review and introduction purposes. All rights belong to the copyright holders.<\/em><\/p>\n

\n
\n

Table of Contents<\/p>\nToggle<\/span><\/path><\/svg><\/svg><\/span><\/span><\/span><\/a><\/span><\/div>\n